(algorithm)
Definition: An algorithm to code English words (and foreign words often heard in the United States) phonetically by reducing them to 12 consonant sounds. This reduces matching problems from wrong spelling.
Generalization (I am a kind of ...)
phonetic coding algorithm.
See also Jaro-Winkler, Caverphone, NYSIIS, soundex, metaphone, Levenshtein distance.
Note: This is an improved version of metaphone. It returns two keys if a word has two feasible pronunciations, such as a foreign word.
Author: PEB
Lawrence Philips, The Double Metaphone Search Algorithm, C/C++ Users Journal, June 2000. http://www.ddj.com/cpp/184401251 accessed December 2007.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2007.
HTML page formatted Mon Dec 17 11:13:12 2007.
Cite this as:
Paul E. Black, "double metaphone", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 December 2007. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/doubleMetaphone.html
