| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lardit (0) - 1 freq laidit (1) - 9 freq ladit (1) - 2 freq landit (1) - 52 freq laedit (1) - 1 freq ledit (2) - 1 freq laundit (2) - 11 freq addit (2) - 97 freq fadit (2) - 10 freq learit (2) - 3 freq lart (2) - 1 freq wareit (2) - 1 freq bardic (2) - 5 freq yarkit (2) - 2 freq 'audit (2) - 1 freq bandit (2) - 7 freq dargit (2) - 2 freq laupit (2) - 1 freq randit (2) - 1 freq marrit (2) - 1 freq laggit (2) - 1 freq haudit (2) - 42 freq plaidit (2) - 5 freq lampit (2) - 1 freq blaudit (2) - 2 freq |
lardit (0) - 1 freq landit (2) - 52 freq laedit (2) - 1 freq ladit (2) - 2 freq laidit (2) - 9 freq laandit (3) - 4 freq beardit (3) - 2 freq lard (3) - 4 freq wirdit (3) - 1 freq lordis (3) - 3 freq landet (3) - 5 freq lerrit (3) - 2 freq mirdit (3) - 1 freq lirkit (3) - 7 freq bardet (3) - 1 freq larnt (3) - 13 freq lairnit (3) - 5 freq bordit (3) - 1 freq lairdie (3) - 3 freq loadit (3) - 19 freq loddit (3) - 2 freq dirdit (3) - 5 freq lernit (3) - 1 freq lairit (3) - 1 freq awardit (3) - 4 freq |
SoundEx code - L633 lardit - 1 freq |
MetaPhone code - LRTT lardit - 1 freq |
LARDIT |
| Time to execute Levenshtein function - 0.243845 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.357337 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.027491 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.037152 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.000812 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. |