| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ameebitous (0) - 1 freq ubeeqitous (3) - 1 freq ambeetious (3) - 1 freq ambitious (3) - 10 freq ambitons (3) - 1 freq veesitors (4) - 50 freq 'veesitors (4) - 1 freq amenities (4) - 4 freq ambeitioun (4) - 1 freq maleecious (4) - 1 freq veecious (4) - 2 freq keerious (4) - 3 freq meenites (4) - 2 freq freemious (4) - 1 freq meenits (4) - 247 freq 'ambitious (4) - 1 freq creeditors (4) - 1 freq meenit's (4) - 14 freq meenity's (4) - 3 freq ambeitiouns (4) - 1 freq ambituons (4) - 1 freq preecious (4) - 2 freq ambiguous (4) - 2 freq imperious (4) - 4 freq eebrous (4) - 3 freq |
ameebitous (0) - 1 freq ambeetious (3) - 1 freq ambitious (3) - 10 freq ambitons (4) - 1 freq ambiguous (5) - 2 freq meenites (5) - 2 freq ubeeqitous (5) - 1 freq meenits (5) - 247 freq ambeitiouns (5) - 1 freq amenities (5) - 4 freq ambituons (5) - 1 freq ambitions (5) - 7 freq 'ambitious (5) - 1 freq ambeitioun (5) - 1 freq meenutes (6) - 1 freq ambeition (6) - 2 freq habitus (6) - 1 freq meets (6) - 35 freq meeeets (6) - 1 freq mebbies (6) - 58 freq merits (6) - 7 freq impetus (6) - 3 freq impetuous (6) - 2 freq ambition (6) - 16 freq ambeetion (6) - 7 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 - AMBTS ameebitous - 1 freq |
AMEEBITOUS |
| Time to execute Levenshtein function - 0.200668 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.375601 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.028312 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.037991 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.000903 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. |