| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ataafoi (0) - 1 freq ataa (3) - 8 freq aaaahoo (3) - 1 freq atari (3) - 1 freq amalfi (3) - 1 freq aafo (3) - 8 freq naafi (3) - 1 freq aaaah (4) - 1 freq awaar (4) - 20 freq staal (4) - 2 freq agai (4) - 2 freq atae (4) - 1 freq amazon (4) - 22 freq aaaargh (4) - 1 freq caai (4) - 1 freq ataw' (4) - 1 freq taboo (4) - 4 freq atlantik (4) - 3 freq tapsoil (4) - 1 freq taft (4) - 1 freq staarns (4) - 2 freq straff (4) - 2 freq staffs (4) - 1 freq tagalog (4) - 2 freq taaked (4) - 13 freq |
ataafoi (0) - 1 freq tfi (4) - 2 freq taf (4) - 1 freq aafo (4) - 8 freq naafi (4) - 1 freq ataa (4) - 8 freq atari (4) - 1 freq taak (5) - 94 freq aafu (5) - 14 freq taas (5) - 1 freq afo (5) - 4 freq laafu (5) - 9 freq aalf (5) - 1 freq faaf (5) - 1 freq raaf (5) - 1 freq atli (5) - 1 freq affo (5) - 5 freq tief (5) - 3 freq taxi (5) - 85 freq toof (5) - 1 freq awfi (5) - 5 freq aafa (5) - 14 freq otago (5) - 2 freq taco (5) - 1 freq atop (5) - 6 freq |
SoundEx code - A310 atap - 23 freq adobe - 2 freq a-tap - 1 freq atop - 6 freq at'v - 2 freq a-type - 1 freq atv - 1 freq a'd've - 1 freq atp - 1 freq aitbo - 1 freq ataafoi - 1 freq aytp - 1 freq |
MetaPhone code - ATF at'v - 2 freq atv - 1 freq a'd've - 1 freq ataafoi - 1 freq |
ATAAFOI |
| Time to execute Levenshtein function - 0.655615 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 - 1.138997 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.094483 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.097184 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.000901 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. |