| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lizard (0) - 32 freq lizards (1) - 3 freq wizard (1) - 18 freq hazard (2) - 2 freq minzard (2) - 1 freq wizard' (2) - 1 freq liar (2) - 24 freq lozart (2) - 1 freq loard (2) - 244 freq bizzard (2) - 1 freq libary (2) - 1 freq blizzard (2) - 4 freq liars (2) - 1 freq wizards (2) - 1 freq bizarn (2) - 1 freq wizzard (2) - 1 freq livari (2) - 1 freq lizard's (2) - 7 freq lard (2) - 4 freq mozart (3) - 12 freq shard (3) - 2 freq lark (3) - 23 freq liter (3) - 1 freq lirk (3) - 5 freq swoard (3) - 2 freq |
lizard (0) - 32 freq wizard (2) - 18 freq lizards (2) - 3 freq lozart (3) - 1 freq lard (3) - 4 freq loard (3) - 244 freq hazard (3) - 2 freq leonard (4) - 63 freq lzra (4) - 1 freq lord (4) - 396 freq lazarus (4) - 20 freq loardo (4) - 1 freq leopard (4) - 5 freq laird (4) - 172 freq lourd (4) - 11 freq lowurd (4) - 1 freq lanyard (4) - 1 freq leared (4) - 1 freq bizzard (4) - 1 freq wizzard (4) - 1 freq liar (4) - 24 freq wizard' (4) - 1 freq libary (4) - 1 freq bizarn (4) - 1 freq liars (4) - 1 freq |
SoundEx code - L263 lizard - 32 freq lizard's - 7 freq lucrative - 2 freq lacquert - 1 freq laceratin - 1 freq lazaretto - 1 freq lacerated - 1 freq leisured - 1 freq lug-rattlin - 1 freq lockhart - 4 freq lockhart's - 1 freq laceratit - 1 freq lizards - 3 freq laggered - 2 freq logarithms - 1 freq lgarden - 1 freq luxuriatin - 1 freq lozart - 1 freq |
MetaPhone code - LSRT lizard - 32 freq lazaretto - 1 freq leisured - 1 freq lozart - 1 freq |
LIZARD |
| Time to execute Levenshtein function - 0.212699 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.339348 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.027415 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.037574 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.000855 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. |