| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| millisle (0) - 5 freq millisle' (1) - 1 freq bellisle (2) - 1 freq willile (2) - 1 freq millie (2) - 5 freq i'isle (3) - 1 freq missile (3) - 6 freq mill's (3) - 2 freq melville (3) - 1 freq uillie (3) - 1 freq gillis (3) - 1 freq million (3) - 155 freq millies (3) - 1 freq gillie (3) - 2 freq sillie (3) - 2 freq millins (3) - 1 freq multiple (3) - 22 freq williame (3) - 1 freq villish (3) - 1 freq malaise (3) - 1 freq tillie (3) - 8 freq willinly (3) - 2 freq mirlie (3) - 1 freq killie (3) - 26 freq mille (3) - 1 freq |
millisle (0) - 5 freq millisle' (2) - 1 freq bellisle (3) - 1 freq mellissae (4) - 1 freq millies (4) - 1 freq millie (4) - 5 freq mills (4) - 33 freq willile (4) - 1 freq millions (5) - 66 freq carlisle (5) - 4 freq mellie (5) - 2 freq willis (5) - 1 freq millwall (5) - 1 freq moblile (5) - 1 freq gullible (5) - 3 freq millfield (5) - 2 freq gallusly (5) - 3 freq mells (5) - 10 freq mallies (5) - 1 freq mulls (5) - 6 freq kellsley (5) - 3 freq haillsale (5) - 1 freq lillie (5) - 4 freq mollie (5) - 16 freq millin (5) - 6 freq |
SoundEx code - M424 molecules - 1 freq malcolm - 33 freq 'malcolm - 2 freq millisle - 5 freq millisle' - 1 freq malcolme - 1 freq malcolms - 1 freq malcolmbrown - 3 freq malcolmnichols - 1 freq |
MetaPhone code - MLSL millisle - 5 freq millisle' - 1 freq |
MILLISLE |
| Time to execute Levenshtein function - 0.581881 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 - 1.113605 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.093980 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.106393 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. |