Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
lomond (0) - 16 freq lowmond (1) - 3 freq lamond (1) - 1 freq roond (2) - 946 freq lamont (2) - 8 freq hoond (2) - 2 freq loons (2) - 175 freq looed (2) - 8 freq lood (2) - 153 freq rooond (2) - 1 freq lemon (2) - 23 freq towmond (2) - 12 freq woond (2) - 5 freq comon (2) - 1 freq boond (2) - 9 freq lemony (2) - 1 freq poond (2) - 13 freq loon' (2) - 2 freq almond (2) - 4 freq mond (2) - 4 freq mormond (2) - 5 freq loon (2) - 667 freq foond (2) - 140 freq lemons (2) - 2 freq loony (2) - 1 freq |
lomond (0) - 16 freq lamond (1) - 1 freq almond (2) - 4 freq lowmond (2) - 3 freq limned (3) - 1 freq lemony (3) - 1 freq mond (3) - 4 freq lemons (3) - 2 freq emond (3) - 1 freq lemon (3) - 23 freq lamont (3) - 8 freq lemonade (3) - 13 freq limonade (3) - 1 freq demand (4) - 51 freq louman (4) - 1 freq lyand (4) - 1 freq leman (4) - 3 freq land (4) - 340 freq laund (4) - 89 freq hominid (4) - 1 freq 'mynd (4) - 3 freq mind (4) - 2299 freq lambed (4) - 2 freq monde (4) - 1 freq looming (4) - 3 freq |
SoundEx code - L553 lowmond - 3 freq lament - 21 freq lamont - 8 freq laments - 9 freq lamond - 1 freq lemonade - 13 freq lomond - 16 freq lamentatiouns - 2 freq laminated - 5 freq lamentation - 4 freq lenient - 2 freq lamentin - 6 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 - LMNT lowmond - 3 freq lament - 21 freq lamont - 8 freq lamond - 1 freq lemonade - 13 freq lomond - 16 freq limned - 1 freq laminit - 1 freq leemonade - 2 freq laminate - 2 freq limonade - 1 freq lamante - 1 freq 'lament - 3 freq luminate - 1 freq |
LOMOND |
Time to execute Levenshtein function - 0.210617 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.383197 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.034563 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.036565 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.000863 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. |