| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mulcaire (0) - 4 freq multure (3) - 1 freq malaise (3) - 1 freq delmaire (3) - 1 freq milkcairt (3) - 1 freq maire (3) - 146 freq mulctit (3) - 1 freq muchie (3) - 13 freq macabre (3) - 1 freq muckie (3) - 1 freq malcware (3) - 1 freq eclaire (3) - 1 freq voltaire (3) - 1 freq claire (3) - 10 freq munchie (3) - 4 freq milgavie (4) - 1 freq malice (4) - 3 freq buckie (4) - 45 freq multiple (4) - 22 freq funfair (4) - 1 freq ukraine (4) - 10 freq €œlaird (4) - 2 freq munching (4) - 2 freq mundie (4) - 4 freq flair (4) - 398 freq |
mulcaire (0) - 4 freq multure (4) - 1 freq malcware (4) - 1 freq morcar (5) - 4 freq millar (5) - 11 freq malir (5) - 1 freq malice (5) - 3 freq mulch (5) - 2 freq macari (5) - 1 freq ulcer (5) - 1 freq mulder (5) - 1 freq melchi (5) - 2 freq munchie (5) - 4 freq melchior (5) - 1 freq mascara (5) - 3 freq eclaire (5) - 1 freq muckie (5) - 1 freq mulctit (5) - 1 freq muchie (5) - 13 freq macabre (5) - 1 freq delmaire (5) - 1 freq maire (5) - 146 freq malaise (5) - 1 freq milkcairt (5) - 1 freq claire (5) - 10 freq |
SoundEx code - M426 malgrati - 2 freq malagruized - 1 freq malagaroused - 1 freq malagarousin - 1 freq malagaroose - 1 freq mulligrumphin - 1 freq malagrugous-lookin - 1 freq malagrugrous - 3 freq mulligrups - 1 freq melchers - 1 freq melchior - 1 freq myl-gruel - 1 freq mulcaire - 4 freq milgruel - 1 freq milkcairt - 1 freq malagrugous - 1 freq malagrugous-lik - 1 freq malagroused - 1 freq 'mouligrabber' - 1 freq malcware - 1 freq |
MetaPhone code - MLKR mulcaire - 4 freq |
MULCAIRE |
| Time to execute Levenshtein function - 0.214300 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.365838 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.027682 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.037722 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.000892 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. |