We investigate the effect of incorporating syntactic information into a word-completion algorithm. We introduce two new algorithms that combine part-of-speech tag trigrams with word bigrams, and evaluate them with a testbench constructed for the purpose. The results show a small but statistically significant improvement in keystroke savings for one of our algorithms over baselines that use only word n-grams.
Download: PDF
file (61 Kb);
PostScript
file (117 Kb).
Request paper copy: Send
request with postal address to gh@cs.txrxntx.edu (replace the Xs with
Os).
[an error occurred while processing this directive]
[an error occurred while processing this directive]