| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anabody (0) - 1 freq aabody (1) - 342 freq anybody (1) - 74 freq aabudy (2) - 1 freq nab'dy (2) - 1 freq oanybody (2) - 1 freq aabdy (2) - 9 freq awbody (2) - 266 freq anyboady (2) - 13 freq nacbody (2) - 6 freq anybdy (2) - 2 freq anatomy (2) - 5 freq aabidy (2) - 2 freq 'naebody (2) - 23 freq aab'dy (2) - 1 freq analogy (2) - 9 freq anybidy (2) - 1 freq a'body (2) - 24 freq 'aabody (2) - 1 freq naebody (2) - 643 freq onbody (2) - 1 freq awebody (2) - 10 freq nobody (2) - 48 freq onybody (2) - 416 freq aebody (2) - 1 freq |
anabody (0) - 1 freq anybody (1) - 74 freq anybidy (2) - 1 freq anybdy (2) - 2 freq naebody (2) - 643 freq nobody (2) - 48 freq anyboady (2) - 13 freq onbody (2) - 1 freq onybody (2) - 416 freq aabody (2) - 342 freq oanybody (2) - 1 freq naebdy (3) - 93 freq nebdy (3) - 1 freq naebudy (3) - 2 freq nacbody (3) - 6 freq neabdy (3) - 1 freq oniebody (3) - 15 freq onybidy (3) - 1 freq onybdy (3) - 9 freq onybudy (3) - 6 freq onyboady (3) - 1 freq naebidy (3) - 14 freq enubdy (3) - 1 freq neebody (3) - 1 freq nobudy (3) - 1 freq |
SoundEx code - A513 anyboady - 13 freq anybody's - 3 freq anybody - 74 freq amputated - 1 freq ambitions - 7 freq ambeetion - 7 freq amputatit - 3 freq ambition - 16 freq ambeition - 2 freq ambituons - 1 freq amphitheatre - 2 freq ambitons - 1 freq anybuddie - 3 freq ambitious - 10 freq ambeetious - 1 freq ambeitiouns - 1 freq ambeitioun - 1 freq anybidy - 1 freq ameebitous - 1 freq €œambidextrous - 1 freq amputations - 1 freq amputee - 2 freq anybdy - 2 freq anyboadys - 1 freq amybethmiah - 1 freq ‘ambitionsÂ’ - 1 freq anabody - 1 freq 'ambitious - 1 freq ambedka - 8 freq ammyfitbanews - 22 freq anybuddy - 1 freq |
MetaPhone code - ANBT anyboady - 13 freq anybody - 74 freq anybuddie - 3 freq anybidy - 1 freq anybdy - 2 freq anabody - 1 freq anybuddy - 1 freq |
ANABODY |
| Time to execute Levenshtein function - 0.185284 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.361966 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.029052 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.042185 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000978 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |