The smallest number of insertions, deletions, and substitutions required to
change one string or tree into another. A H(m x n) algorithm to compute the
distance between strings, where m and n are the lengths of the strings (http://
www.nist.gov/dads/HTML/levenshtein.html).
Minimum.edit.distance. Minimum edit distance is based on calculating the distance
between a misspelled word and eh words in its files. Words whose evaluated
distance is the smallest are offered as candidates for replacement.
n-gram is an n-letter subsequence of a string, where n is usually 1,2, or 3. In general,
n-gram analysis techniques check each n-gram in an input string against
a precompiled table of n-gram statistics to determine whether the n-gram can
occur in a word. If it does, its frequency of occurrence in the words of the
language is computed. Strings containing n-grams that do not occur in words
or occur very infrequently are considered to be possible misspellings.
Phoneme. Phoneme is the smallest unit of sound in a language which can distinguish
two words, that is, pan and ban differ in that pan begins with /p/ and
ban begins with /b/.
Pages:
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815