| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lzra (0) - 1 freq lora (1) - 1 freq lara (1) - 1 freq ezra (1) - 3 freq clara (2) - 9 freq €˜ra (2) - 1 freq lare (2) - 7 freq lava (2) - 4 freq ara (2) - 1 freq lars (2) - 1 freq lark (2) - 24 freq lorn (2) - 1 freq lyre (2) - 1 freq lxr (2) - 1 freq myra (2) - 14 freq zma (2) - 1 freq bza (2) - 1 freq cara (2) - 3 freq lzk (2) - 1 freq lere (2) - 2 freq erra (2) - 3 freq lpr (2) - 1 freq lisa (2) - 16 freq lna (2) - 1 freq gra (2) - 3 freq |
lzra (0) - 1 freq ezra (2) - 3 freq lara (2) - 1 freq lora (2) - 1 freq zara (3) - 3 freq lzje (3) - 1 freq rzr (3) - 1 freq lz (3) - 3 freq lore (3) - 12 freq lr (3) - 5 freq zry (3) - 1 freq zrae (3) - 1 freq lri (3) - 1 freq lory (3) - 42 freq laura (3) - 190 freq lir (3) - 16 freq azr (3) - 1 freq lire (3) - 2 freq ylzrj (3) - 1 freq ler (3) - 1 freq ultra (3) - 4 freq hzr (3) - 1 freq lgr (3) - 1 freq lzg (3) - 1 freq lzxy (3) - 1 freq |
SoundEx code - L260 leisure - 26 freq luxury - 17 freq lesser - 30 freq liquor - 7 freq liker - 9 freq lookir - 1 freq laugher - 1 freq looker - 8 freq laicher - 5 freq lager - 39 freq leesure - 4 freq lecher - 1 freq lycra - 2 freq lacquer - 2 freq locker - 3 freq looser - 3 freq loser - 4 freq luxurie - 1 freq luckier - 5 freq le'sure - 1 freq lugar - 4 freq leesuir - 1 freq liqueur - 2 freq ligger - 1 freq laser - 4 freq loccery - 1 freq leisur - 4 freq leesur - 1 freq logger - 1 freq lyker - 2 freq luxure - 1 freq look-owre - 1 freq luk-ower - 4 freq lxr - 1 freq licker - 1 freq lzra - 1 freq lgr - 1 freq lukeyhear - 1 freq lgaur - 1 freq lswhr - 1 freq |
MetaPhone code - LSR leisure - 26 freq lesser - 30 freq leesure - 4 freq looser - 3 freq loser - 4 freq le'sure - 1 freq leesuir - 1 freq laser - 4 freq leisur - 4 freq leesur - 1 freq lzra - 1 freq lswhr - 1 freq |
LZRA |
| Time to execute Levenshtein function - 0.427609 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.549750 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.032604 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.044717 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.001232 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. |