| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lizards (0) - 4 freq lizard's (1) - 7 freq wizards (1) - 1 freq lizard (1) - 32 freq liars (2) - 1 freq wizard' (2) - 1 freq blizzards (2) - 1 freq loards (2) - 1 freq wizard (2) - 19 freq tiwards (2) - 3 freq libbards (2) - 1 freq lazarus (2) - 20 freq hazards (2) - 1 freq awards (3) - 35 freq cooards (3) - 2 freq slawards (3) - 1 freq leads (3) - 45 freq ledars (3) - 1 freq boards (3) - 23 freq hoards (3) - 4 freq birds (3) - 198 freq guards (3) - 13 freq innards (3) - 4 freq laands (3) - 2 freq liquids (3) - 2 freq |
lizards (0) - 4 freq lizard (2) - 32 freq wizards (2) - 1 freq lizard's (2) - 7 freq lazarus (3) - 20 freq loards (3) - 1 freq hazards (3) - 1 freq blizzards (4) - 1 freq lords (4) - 27 freq leopards (4) - 3 freq liars (4) - 1 freq lairds (4) - 28 freq wizard (4) - 19 freq tiwards (4) - 3 freq libbards (4) - 1 freq wizard' (4) - 1 freq larks (5) - 4 freq cowards (5) - 5 freq upwards (5) - 12 freq lozart (5) - 1 freq shards (5) - 11 freq loads (5) - 87 freq lires (5) - 1 freq lauds (5) - 1 freq livers (5) - 1 freq |
SoundEx code - L263 lizard - 32 freq lizard's - 7 freq lucrative - 2 freq lacquert - 1 freq laceratin - 1 freq lizards - 4 freq lazaretto - 1 freq lacerated - 1 freq leisured - 1 freq lug-rattlin - 1 freq lockhart - 4 freq lockhart's - 1 freq laceratit - 1 freq laggered - 2 freq logarithms - 1 freq lgarden - 1 freq luxuriatin - 1 freq lozart - 1 freq |
MetaPhone code - LSRTS lizard's - 7 freq lizards - 4 freq |
LIZARDS |
| Time to execute Levenshtein function - 0.191620 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.347396 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.027216 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.037720 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.000957 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. |