Send the link below via email or IMCopy
Present to your audienceStart remote presentation
- Invited audience members will follow you as you navigate and present
- People invited to a presentation do not need a Prezi account
- This link expires 10 minutes after you close the presentation
- A maximum of 30 users can follow your presentation
- Learn more about this feature in our knowledge base article
Do you really want to delete this prezi?
Neither you, nor the coeditors you shared it with will be able to recover it again.
Make your likes visible on Facebook?
Connect your Facebook account to Prezi and let your likes appear on your timeline.
You can change this under Settings & Account at any time.
Transcript of EYPE
shape writing Motivation Challenges conceptual:
parameter fitting for Needleman-Wünsch Future Work improve error rate by
embedding linguistic heuristics
speed up by
highlighting likely follow-up characters
explore mobile applications Eye Typing Using Eye Traces EYPE Sabrina Hoppe
Florian Daiber word / phrase trace of characters matching Needleman-Wünsch-Algorithm considers neighbourhood
good computational complexity
ambiguities, e.g. the vs. three Pros / Cons Needleman-Wünsch match skip input skip optimal O(n*m) Needleman-Wünsch sum up all operations on a path
use result as similarity score
compare input to all suitable words in a dictionary potential of dwell-free
eye-typing thank you
for your attention user study possible applications:
mobile interaction Kristensson & Vertanen (ETRA 12) optimal trace compare Needleman Wünsch Algorithm constant penalty
for skipping penalty for matches
depend on similarity:
- same character