| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lamentit (0) - 1 freq lamentin (1) - 7 freq lamented (2) - 2 freq unlamentit (2) - 1 freq amendit (2) - 2 freq laminit (2) - 1 freq laments (2) - 9 freq laminatit (2) - 1 freq lament (2) - 22 freq talentit (2) - 6 freq lantit (2) - 1 freq dementit (2) - 22 freq lairnit (3) - 5 freq magentie (3) - 1 freq hauntit (3) - 15 freq lannit (3) - 3 freq mantit (3) - 2 freq €œpentit (3) - 1 freq daetit (3) - 1 freq mentie (3) - 2 freq lamplit (3) - 1 freq meltit (3) - 26 freq stentit (3) - 9 freq dauntit (3) - 3 freq learntit (3) - 1 freq |
lamentit (0) - 1 freq laminatit (2) - 1 freq lamentin (2) - 7 freq lantit (3) - 1 freq dementit (3) - 22 freq laments (3) - 9 freq lament (3) - 22 freq lamented (3) - 2 freq laminit (3) - 1 freq unlamentit (3) - 1 freq learntit (4) - 1 freq lamont (4) - 8 freq muntit (4) - 3 freq limitit (4) - 9 freq myntit (4) - 3 freq lamante (4) - 1 freq luntit (4) - 3 freq mintit (4) - 28 freq amendit (4) - 2 freq mantit (4) - 2 freq talentit (4) - 6 freq paintit (5) - 22 freq gantit (5) - 10 freq maetit (5) - 1 freq dementia (5) - 9 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 - LMNTT laminated - 5 freq lamentit - 1 freq lamented - 2 freq laminatit - 1 freq |
LAMENTIT |
| Time to execute Levenshtein function - 0.524996 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.882652 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.029943 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.082306 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.000852 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. |