| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ayallar (0) - 4 freq yallad (2) - 1 freq yalla (2) - 99 freq yallas (2) - 1 freq aaltar (2) - 2 freq €œayallar (2) - 1 freq callar (2) - 4 freq yallae (2) - 5 freq gallas (3) - 1 freq yall (3) - 3 freq avatar (3) - 2 freq pallor (3) - 4 freq yalla's (3) - 1 freq macallan (3) - 3 freq swallaa (3) - 1 freq yallit (3) - 1 freq yallt (3) - 1 freq yellad (3) - 1 freq angular (3) - 1 freq auller (3) - 1 freq shalla (3) - 9 freq yalday (3) - 1 freq ayar (3) - 1 freq ryall (3) - 1 freq arillas (3) - 1 freq |
ayallar (0) - 4 freq yallad (3) - 1 freq auller (3) - 1 freq yellaer (3) - 1 freq aller (3) - 2 freq yallae (3) - 5 freq callar (3) - 4 freq yalla (3) - 99 freq yallas (3) - 1 freq aaltar (3) - 2 freq ellar (3) - 1 freq allure (4) - 2 freq lyall (4) - 9 freq aaltir (4) - 1 freq caller (4) - 80 freq yella (4) - 130 freq allay (4) - 1 freq pillar (4) - 15 freq taller (4) - 24 freq yellae (4) - 55 freq aall (4) - 3 freq yallow (4) - 3 freq allah (4) - 1 freq yallaed (4) - 1 freq yalled (4) - 5 freq |
SoundEx code - A460 aaler - 17 freq aul'er - 1 freq auler - 17 freq auller - 1 freq aller - 2 freq allure - 2 freq a-leary - 1 freq a-leerie - 1 freq ayallar - 4 freq €œayallar - 1 freq aulÂ’er - 1 freq aleerie' - 1 freq |
MetaPhone code - AYLR ayallar - 4 freq €œayallar - 1 freq |
AYALLAR |
| Time to execute Levenshtein function - 0.290200 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.533740 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.044165 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.047668 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.000956 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. |