Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
mervel (0) - 5 freq merkel (1) - 1 freq marvel (1) - 6 freq mervels (1) - 1 freq dervel (1) - 1 freq mervelt (1) - 1 freq morsel (2) - 5 freq merles (2) - 1 freq meel (2) - 3 freq mervelin (2) - 1 freq mertet (2) - 1 freq nerve (2) - 21 freq server (2) - 2 freq mareel (2) - 3 freq merse (2) - 4 freq morven (2) - 2 freq derval (2) - 17 freq mervellt (2) - 1 freq terrel (2) - 6 freq merely (2) - 12 freq merle (2) - 5 freq farvel (2) - 1 freq eersel (2) - 28 freq mairvel (2) - 2 freq serve (2) - 72 freq |
mervel (0) - 5 freq marvel (1) - 6 freq mairvel (2) - 2 freq mervelt (2) - 1 freq dervel (2) - 1 freq merkel (2) - 1 freq mervels (2) - 1 freq murrel (3) - 1 freq merely (3) - 12 freq merle (3) - 5 freq marvels (3) - 1 freq morven (3) - 2 freq mervyn (3) - 2 freq farvel (3) - 1 freq derval (3) - 17 freq revel (3) - 2 freq mervelin (3) - 1 freq muriel (3) - 5 freq dervil (3) - 1 freq morsel (3) - 5 freq mareel (3) - 3 freq marvin (4) - 8 freq gravel (4) - 9 freq murl (4) - 2 freq mairvels (4) - 1 freq |
SoundEx code - M614 mairvel - 2 freq marble - 21 freq marple - 2 freq marbles - 5 freq mairble - 4 freq mervellous - 28 freq marvellous - 10 freq mervel - 5 freq merble - 2 freq mervelin - 1 freq marvelous - 2 freq marbill - 1 freq mervellously - 2 freq 'mervellous - 1 freq marble-lined - 1 freq 'mairvellous - 1 freq mervelt - 1 freq mervellt - 1 freq marbelt - 1 freq mervelously - 1 freq marvel - 6 freq murrayfield - 8 freq mairvellous - 1 freq mairvellin - 1 freq morphology - 3 freq morphological - 4 freq marble' - 1 freq mairvels - 1 freq marvels - 1 freq marvelled - 1 freq mervels - 1 freq marvellan - 1 freq marvellousadam - 2 freq mrblairbowman - 2 freq mhairiblack - 2 freq mrraffaelli - 1 freq marplejane - 1 freq marvilliss - 1 freq maryfield - 1 freq |
MetaPhone code - MRFL mairvel - 2 freq mervel - 5 freq marvel - 6 freq mrraffaelli - 1 freq |
MERVEL |
Time to execute Levenshtein function - 0.356355 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.739857 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.113595 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.089648 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.001243 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. |