| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| amputee (0) - 2 freq amputated (3) - 1 freq acute (3) - 1 freq amused (3) - 16 freq amrut (3) - 1 freq impulse (3) - 5 freq amdee (3) - 1 freq pute (3) - 4 freq cammatee (3) - 1 freq mute (3) - 11 freq ameuse (3) - 1 freq amounted (3) - 1 freq puntee (3) - 1 freq umpteen (3) - 15 freq amuse (3) - 8 freq mintee (3) - 1 freq applee (3) - 1 freq astute (3) - 1 freq amulree (3) - 2 freq amitie (3) - 5 freq depute (3) - 21 freq emptie (3) - 1 freq deputes (3) - 1 freq impure (3) - 1 freq compute (3) - 2 freq |
amputee (0) - 2 freq emptie (3) - 1 freq umpteen (4) - 15 freq ample (4) - 9 freq repute (4) - 12 freq amitie (4) - 5 freq compute (4) - 2 freq impty (4) - 14 freq empty (4) - 207 freq mintee (4) - 1 freq depute (4) - 21 freq amrut (4) - 1 freq ympteen (4) - 1 freq impit (4) - 1 freq putey (4) - 3 freq impure (4) - 1 freq pute (4) - 4 freq mute (4) - 11 freq mout (5) - 1 freq repete (5) - 1 freq impetus (5) - 3 freq moste (5) - 1 freq emptiet (5) - 1 freq mentae (5) - 1 freq mutt (5) - 6 freq |
SoundEx code - A513 anyboady - 13 freq anybody's - 3 freq anybody - 76 freq amputated - 1 freq ambitions - 7 freq ambeetion - 7 freq amputatit - 3 freq ambituons - 1 freq amphitheatre - 2 freq ambition - 14 freq ambitons - 1 freq anybuddie - 3 freq ambitious - 10 freq ambeetious - 1 freq ambeitiouns - 1 freq ambeition - 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 - AMPT amputee - 2 freq |
AMPUTEE |
| Time to execute Levenshtein function - 0.194548 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.350309 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.027423 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.036958 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.000835 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. |