Ternary Search Tree for Auto-Completion and Spell Checking

A ternary search tree is a type of prefix tree with up to three children and the ability for incremental string search. The package uses this ability for word auto-completion and spell checking. Includes a dataset with the 10001 most frequent English words.


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


1.2 by Ricardo Merino, 6 years ago

Browse source code at https://github.com/cran/TSTr

Authors: Ricardo Merino [aut, cre] , Samantha Fernandez [ctb]

Documentation:   PDF Manual  

GPL-2 license

Imports stringr, stringdist, stats, data.table

Suggests knitr

See at CRAN