Learn R Programming

TSTr (version 1.2)

Ternary Search Tree for Auto-Completion and Spell Checking

Description

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.

Copy Link

Version

Install

install.packages('TSTr')

Monthly Downloads

31

Version

1.2

License

GPL-2

Maintainer

Ricardo Merino

Last Published

October 31st, 2015

Functions in TSTr (1.2)

addToTree

Adds a set of strings to a ternary search tree
PNcheck

Spell checking using ternary search trees
TSTr-package

Ternary Search Tree for Auto-Completion and Spell Checking
newTree

Creates a new ternary search tree
addWord

Adds a single word or string
completeWord

Autocompletion of strings
XMIwords

10001 most frequent English words
SDcheck

Performs spell checking using symmetric delete spell correction
dimTree

Tree dimensions
searchWord

Search a string
SDkeeper

Pre-creates a data.table or a ternary search tree