TSTr: 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.

Package details

AuthorRicardo Merino [aut, cre], Samantha Fernandez [ctb]
MaintainerRicardo Merino <[email protected]>
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:

Try the TSTr package in your browser

Any scripts or data that you put into this service are public.

TSTr documentation built on May 29, 2017, 12:04 p.m.