Measuring Performance of a Predictive Keyboard Operated by Humming
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F12%3A00194235" target="_blank" >RIV/68407700:21230/12:00194235 - isvavai.cz</a>
Result on the web
<a href="http://www.springerlink.com/content/cq7437782231732k/" target="_blank" >http://www.springerlink.com/content/cq7437782231732k/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-31534-3_69" target="_blank" >10.1007/978-3-642-31534-3_69</a>
Alternative languages
Result language
angličtina
Original language name
Measuring Performance of a Predictive Keyboard Operated by Humming
Original language description
A number of text entry methods use a predictive completion based on letter-level n-gram model. In this paper, we investigate on an optimal length of n-grams stored in such model for a predictive keyboard operated by humming. In order to find the length,we analyze six different corpora, from which a model is built by counting number of primitive operations needed to enter a text. Based on these operations, we provide a formula for estimation of words per minute (WPM) rate. The model and the analysis results are verified in an experiment with three experienced users of the keyboard.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
R - Projekt Ramcoveho programu EK
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Computers Helping People with Special Needs
ISBN
978-3-642-31533-6
ISSN
0302-9743
e-ISSN
—
Number of pages
8
Pages from-to
467-474
Publisher name
Springer
Place of publication
Heidelberg
Event location
Linz
Event date
Jul 11, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—