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.

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


Reference manual: TSTr.pdf
Vignettes: Ternary Search Tree
Package source: TSTr_1.2.tar.gz
Windows binaries: r-devel: TSTr_1.2.zip, r-release: TSTr_1.2.zip, r-oldrel: TSTr_1.0.zip
OS X Snow Leopard binaries: r-release: TSTr_1.2.tgz, r-oldrel: not available
OS X Mavericks binaries: r-release: TSTr_1.2.tgz
Old sources: TSTr archive