| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lamentin (0) - 7 freq lamentit (1) - 1 freq lamented (2) - 2 freq laments (2) - 9 freq lament (2) - 22 freq cementin (2) - 1 freq unlamentin (2) - 1 freq waementin (2) - 1 freq parentin (2) - 1 freq augmentin (3) - 1 freq avertin (3) - 1 freq lantit (3) - 1 freq laundin (3) - 14 freq cantin (3) - 4 freq laetir (3) - 2 freq tormentin (3) - 5 freq lairnin (3) - 185 freq lavein (3) - 1 freq amountin (3) - 1 freq maetin (3) - 3 freq unlamentit (3) - 1 freq baetin (3) - 4 freq dementit (3) - 22 freq lactatin (3) - 1 freq mentie (3) - 2 freq |
lamentin (0) - 7 freq lamentit (2) - 1 freq waementin (3) - 1 freq cementin (3) - 1 freq lamination (3) - 1 freq unlamentin (3) - 1 freq laments (3) - 9 freq lamented (3) - 2 freq lament (3) - 22 freq mintin (4) - 20 freq laminatit (4) - 1 freq laminit (4) - 1 freq lamante (4) - 1 freq myntin (4) - 1 freq limnin (4) - 1 freq muntin (4) - 11 freq 'mention (4) - 1 freq lamont (4) - 8 freq mentain (4) - 1 freq amountin (4) - 1 freq mantin (4) - 1 freq luntin (4) - 1 freq lamentation (4) - 4 freq augmentin (4) - 1 freq parentin (4) - 1 freq |
SoundEx code - L553 lowmond - 3 freq lament - 22 freq lamont - 8 freq laments - 9 freq lamond - 1 freq lemonade - 13 freq lomond - 17 freq lamentatiouns - 2 freq lamentin - 7 freq laminated - 5 freq lamentation - 4 freq lenient - 2 freq lamentit - 1 freq lunnonderrie - 1 freq lamentable - 1 freq laminit - 1 freq leenyint - 1 freq lamented - 2 freq laminatit - 1 freq leemonade - 2 freq lemonades - 1 freq lamantation - 1 freq lamentations - 1 freq laminate - 2 freq lamination - 1 freq limonade - 1 freq luminatus - 1 freq lamante - 1 freq 'lament - 3 freq luminatescot - 5 freq luminate - 1 freq |
MetaPhone code - LMNTN lamentin - 7 freq |
LAMENTIN |
| Time to execute Levenshtein function - 0.238360 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.377279 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.028508 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.037475 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.000934 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. |