| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ujazqaa (0) - 1 freq ujlzla (3) - 1 freq jazza (3) - 2 freq aaaa (4) - 2 freq uaq (4) - 1 freq plaza (4) - 3 freq snaabaa (4) - 4 freq jabba (4) - 1 freq piazzas (4) - 1 freq hannaa (4) - 1 freq hazmat (4) - 1 freq gjaan (4) - 1 freq xfaaa (4) - 1 freq narraa (4) - 1 freq snabaa (4) - 1 freq naaaaa (4) - 1 freq yaeqxa (4) - 1 freq bazuka (4) - 1 freq jaytat (4) - 2 freq ujqzzs (4) - 1 freq shadaa (4) - 2 freq sgzqta (4) - 1 freq waznae (4) - 3 freq udqa (4) - 1 freq jagwar (4) - 1 freq |
ujazqaa (0) - 1 freq jazza (4) - 2 freq jzq (4) - 1 freq jacqui (5) - 1 freq ujlzla (5) - 1 freq jazz (5) - 16 freq jacquie (6) - 1 freq jizz (6) - 1 freq janela (6) - 5 freq zqe (6) - 1 freq gazan (6) - 2 freq jaguar (6) - 2 freq jalaw (6) - 1 freq jazzer (6) - 1 freq jamma (6) - 1 freq jannai (6) - 3 freq jaas (6) - 15 freq jaan (6) - 1 freq jwzeq (6) - 1 freq aqua (6) - 12 freq piazza (6) - 1 freq joeq (6) - 1 freq mazza (6) - 1 freq gaza (6) - 1 freq zq (6) - 6 freq |
SoundEx code - U220 uses - 47 freq ukase - 1 freq uises - 36 freq uisage - 9 freq uisses - 2 freq uizes - 7 freq uissis - 1 freq uissage - 3 freq usage - 10 freq usige - 1 freq useco - 1 freq 'uises - 1 freq ujazqaa - 1 freq ukhka - 1 freq uzykj - 4 freq uxoc - 1 freq uigeach - 1 freq |
MetaPhone code - UJSK ¾ujsko - 1 freq ujazqaa - 1 freq |
UJAZQAA |
| Time to execute Levenshtein function - 0.198300 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.416287 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.029147 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.068668 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.000867 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. |