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.
https://anaconda.org/r_test/r-tstr/badges/version.svg
https://anaconda.org/r_test/r-tstr/badges/latest_release_date.svg
https://anaconda.org/r_test/r-tstr/badges/latest_release_relative_date.svg
https://anaconda.org/r_test/r-tstr/badges/platforms.svg
https://anaconda.org/r_test/r-tstr/badges/license.svg
https://anaconda.org/r_test/r-tstr/badges/downloads.svg