| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| merrier (0) - 4 freq terrier (1) - 13 freq cerrier (1) - 1 freq ferrier (1) - 6 freq merried (1) - 14 freq verrier (1) - 1 freq merrie (1) - 7 freq merriet (1) - 39 freq merries (1) - 6 freq ferrie (2) - 7 freq metier (2) - 1 freq merrried (2) - 1 freq ferriet (2) - 1 freq earrier (2) - 1 freq carrier (2) - 15 freq perrie (2) - 1 freq nerrer (2) - 2 freq peerier (2) - 17 freq mercies (2) - 3 freq berries (2) - 25 freq jerries (2) - 11 freq farrier (2) - 2 freq jerrie (2) - 5 freq ferrer (2) - 8 freq herriet (2) - 4 freq |
merrier (0) - 4 freq merrie (2) - 7 freq merriet (2) - 39 freq mirrir (2) - 1 freq verrier (2) - 1 freq merries (2) - 6 freq terrier (2) - 13 freq merried (2) - 14 freq cerrier (2) - 1 freq ferrier (2) - 6 freq murriet (3) - 1 freq marriet (3) - 15 freq merrin (3) - 1 freq mirror (3) - 111 freq mirrie (3) - 7 freq merkir (3) - 1 freq merrit (3) - 6 freq merriege (3) - 5 freq merrily (3) - 5 freq married (3) - 29 freq merger (3) - 1 freq tarrier (3) - 1 freq meirrour (3) - 4 freq merker (3) - 6 freq mirkier (3) - 2 freq |
SoundEx code - M660 mirror - 111 freq morear - 3 freq mairower - 11 freq 'mirror - 1 freq mirror' - 1 freq meirour - 1 freq meirrour - 4 freq meirrur - 2 freq merrier - 4 freq mirrir - 1 freq mnrur - 1 freq |
MetaPhone code - MRR mirror - 111 freq morear - 3 freq 'mirror - 1 freq mirror' - 1 freq meirour - 1 freq meirrour - 4 freq meirrur - 2 freq merrier - 4 freq mirrir - 1 freq |
MERRIER |
| Time to execute Levenshtein function - 0.677793 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.814374 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.031197 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.085166 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.000818 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. |