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.
Version: |
1.2 |
Depends: |
R (≥ 3.2.0) |
Imports: |
stringr, stringdist, stats, data.table |
Suggests: |
knitr |
Published: |
2015-10-31 |
Author: |
Ricardo Merino [aut, cre],
Samantha Fernandez [ctb] |
Maintainer: |
Ricardo Merino <ricardo.merino.raldua at gmail.com> |
License: |
GPL-2 |
NeedsCompilation: |
no |
CRAN checks: |
TSTr results |