Package pt.tumba.spell

Provides Java applications with a spelling checking functionality, implemented with basis on the ternary search tree data structure proposed by Jon Bentley and Bob Sedgewick in the article "Ternary Search Trees".

See:
Description

Class Summary

Aspell	This is a wrapper around the command aspell (version .33.7.1-alpha) with its output reformated so that it can be compared with that of JaSpell.
Benchmark	This is a benchmarking class, usefull for measuring how well this package is doing.
BloomFilter	Implementation of a Bloom Filter data structure, an elegant alternative to the lookup hash table.
CommonMisspellings	CommonMisspellings is a simple bad word to good word lookup table.
DefaultWordFinder	A word finder for normal text documents, which searches text for sequences of words and text blocks.This class also defines common methods and behaviour for the various word finding subclasses.
JaSpell	This class provides a command line interface for the spelling checking package, similar in style to that of Aspell, also serving as an example of how to use the package from another Java program.
KeyboardProximity	Implementation of String similarity measures with basis on Keyboard proximity.
LevenshteinDistance	This classs holds the methods to compute a modified Levenshtein distance.
Phonetic	Implementation of Phonetic similarity algorithms (Soundex, Metaphone and Double Metaphone), used to reduce matching problems from wrong spellings.
SpellChecker	The main class of the spell checking package.
StringUtils	A collection of String handling utility methods.
TernarySearchTrie	Implementation of a Ternary Search Trie, a data structure for storing String objects that combines the compact size of a binary search tree with the speed of a digital search trie, and is therefore ideal for practical use in sorting and searching data.
TeXWordFinder	A word finder for TeX and LaTeX documents, which searches text for sequences of letters, but ignores any commands and environments as well as Math environments.
XMLWordFinder	A word finder for XMLdocuments, which searches text for sequences of letters, but ignores tags.

Package pt.tumba.spell Description

Provides Java applications with a spelling checking functionality, implemented with basis on the ternary search tree data structure proposed by Jon Bentley and Bob Sedgewick in the article "Ternary Search Trees".