(classic problem)
Definition: Code a string based on how it is pronounced.
Specialization (... is a kind of me.)
double metaphone, Jaro-Winkler, Caverphone, NYSIIS, soundex.
See also string matching with errors.
Note: Because spelling variants of names are common in English, algorithms have been developed to code names based on how they sound. Searching and matching is done by converting a name to some phonetic coding, and comparing codings. If I type "Hansen" into my electronic telephone book, it is useful for it to offer "Hanson" as a possible match.
Levenshtein distance and other measures or algorithms allowing for spelling errors usually have sophisticated matching routines, rather than preprocessing the names.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:24:27 2004.
HTML page formatted Wed Oct 26 09:47:57 2005.
Cite this as:
Paul E. Black, "phonetic coding", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/phoneticCoding.html
