| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eyemooth (0) - 1 freq eyemouth (1) - 1 freq heymooth (2) - 1 freq eyemooth's (2) - 1 freq yermooth (2) - 1 freq €˜mooth (3) - 1 freq mooth (3) - 514 freq €œsmooth (3) - 1 freq eyeteeth (3) - 1 freq smooth (3) - 29 freq yooth (3) - 6 freq bluetooth (4) - 2 freq baadmooth (4) - 1 freq 'remote (4) - 1 freq remote (4) - 27 freq moosh (4) - 2 freq smoots (4) - 2 freq moth (4) - 7 freq drooth (4) - 20 freq bisooth (4) - 1 freq eyesite (4) - 1 freq sooth (4) - 332 freq clooth (4) - 1 freq iooth (4) - 1 freq eediots (4) - 1 freq |
eyemooth (0) - 1 freq eyemouth (1) - 1 freq yermooth (3) - 1 freq heymooth (3) - 1 freq mooth (3) - 514 freq mouth (4) - 45 freq moth (4) - 7 freq smooth (4) - 29 freq yooth (4) - 6 freq eyemooth's (4) - 1 freq eyeteeth (4) - 1 freq month (5) - 330 freq mooth' (5) - 1 freq tooth (5) - 21 freq emosh (5) - 1 freq footh (5) - 4 freq mooch (5) - 25 freq moots (5) - 3 freq youth (5) - 130 freq 'youth (5) - 1 freq booth (5) - 10 freq muith (5) - 1 freq maath (5) - 3 freq mith (5) - 63 freq moothie (5) - 4 freq |
SoundEx code - E530 end - 1198 freq emit - 4 freq enmity - 4 freq eynd - 1 freq endow - 2 freq entae - 43 freq ennit - 2 freq ent - 3 freq einaudi - 1 freq eened - 3 freq endy - 8 freq enda - 2 freq eind - 1 freq end' - 1 freq 'enewed - 1 freq ende - 3 freq emty - 3 freq een-twa - 2 freq een-at - 1 freq endue - 1 freq emdy - 4 freq emmett - 2 freq eyemouth - 1 freq eyemooth - 1 freq |
MetaPhone code - EYM0 eyemouth - 1 freq eyemooth - 1 freq |
EYEMOOTH |
| Time to execute Levenshtein function - 0.579092 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.572047 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.053654 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.036998 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.000758 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. |