| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lovematch (0) - 1 freq davemitch (3) - 6 freq loath (4) - 4 freq soverance (4) - 3 freq sheemach (4) - 1 freq €œmatch (4) - 1 freq pre-match (4) - 2 freq lovesick (4) - 2 freq latch (4) - 11 freq hoatch (4) - 1 freq ellemaich (4) - 1 freq rewatch (4) - 1 freq fobwatch (4) - 2 freq eatch (4) - 1 freq covereth (4) - 1 freq rosehauch (4) - 1 freq lonach (4) - 5 freq match (4) - 177 freq bee-atch (4) - 1 freq doomwatch (4) - 1 freq gomach (4) - 2 freq vratch (4) - 26 freq loveable (4) - 1 freq lovebairn (4) - 1 freq leitch (4) - 11 freq |
lovematch (0) - 1 freq davemitch (4) - 6 freq leitch (6) - 11 freq ellemaich (6) - 1 freq latch (6) - 11 freq €œmatch (6) - 1 freq vratch (6) - 26 freq match (6) - 177 freq livestock (7) - 6 freq lamech (7) - 3 freq mutch (7) - 1 freq moutach (7) - 1 freq mitch (7) - 6 freq smitch (7) - 8 freq maatch (7) - 4 freq metch (7) - 1 freq gomach (7) - 2 freq eleventh (7) - 6 freq latchy (7) - 4 freq svetich (7) - 1 freq sheemach (7) - 1 freq rewatch (7) - 1 freq lovesick (7) - 2 freq doomwatch (7) - 1 freq hoatch (7) - 1 freq |
SoundEx code - L153 lippent - 13 freq lavender - 57 freq loup-hunter - 1 freq leavin't - 2 freq loaf-ends - 2 freq lippend - 1 freq 'lavender - 1 freq lavender's - 4 freq leavent - 1 freq lippened - 11 freq lovematch - 1 freq life-mate - 1 freq lavin-time - 1 freq |
MetaPhone code - LFMX lovematch - 1 freq |
LOVEMATCH |
| Time to execute Levenshtein function - 0.218927 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.364577 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.028204 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.037100 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.000833 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. |