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.
|Author||Ricardo Merino [aut, cre], Samantha Fernandez [ctb]|
|Date of publication||2015-10-31 19:26:02|
|Maintainer||Ricardo Merino <email@example.com>|
|Package repository||View on CRAN|
Install the latest version of this package by entering the following in R:
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.