| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| neep-muck (0) - 1 freq neep-perk (3) - 2 freq neep-park (3) - 3 freq eemock (4) - 8 freq neesick (4) - 1 freq neep-heid (4) - 2 freq jeemick (4) - 2 freq neep-shed (4) - 1 freq deep-couch (4) - 1 freq yee-uch (4) - 1 freq neepur (4) - 1 freq meesick (5) - 2 freq deef-lugs (5) - 1 freq neesicks (5) - 1 freq neep' (5) - 1 freq despotick (5) - 1 freq ree-mogg (5) - 1 freq mega-muckle (5) - 1 freq deep-sea (5) - 4 freq mup-mups (5) - 1 freq seeck (5) - 23 freq oermuch (5) - 1 freq kebbuck (5) - 5 freq kneevlick (5) - 1 freq respeck (5) - 77 freq |
neep-muck (0) - 1 freq neep-park (5) - 3 freq neep-perk (5) - 2 freq deep-couch (7) - 1 freq jeemick (7) - 2 freq neep-shed (7) - 1 freq eemock (7) - 8 freq neep-heid (7) - 2 freq neesick (7) - 1 freq pluck (8) - 12 freq ken-merk (8) - 1 freq re-mak (8) - 1 freq pruck (8) - 5 freq amuck (8) - 1 freq smuck (8) - 1 freq ill-luck (8) - 2 freq ower-muckle (8) - 1 freq expeck (8) - 53 freq bet-lick (8) - 1 freq muck (8) - 69 freq negleck (8) - 7 freq nyuck (8) - 1 freq nubuck (8) - 1 freq kermack (8) - 4 freq joelymack (8) - 1 freq |
SoundEx code - N152 new-fangled - 3 freq neep-muck - 1 freq new-fangl't - 1 freq new-fangelt - 3 freq new-fangit - 1 freq nyow-fangelt - 1 freq newfangelt - 2 freq new-fanglet - 1 freq newfangles - 1 freq newfangledtrow - 2 freq nvnselpqt - 1 freq nfmskeppub - 1 freq nipping - 11 freq napping - 1 freq nbmscotland - 2 freq nbpmcekir - 1 freq nbvmikp - 2 freq nebnns - 1 freq |
MetaPhone code - NPMK neep-muck - 1 freq |
NEEP-MUCK |
| Time to execute Levenshtein function - 0.239613 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.376435 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.029242 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.037824 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.000855 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. |