| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| millans (0) - 1 freq willans (1) - 1 freq millan (1) - 1 freq millins (1) - 1 freq milan (2) - 3 freq millions (2) - 66 freq milla (2) - 1 freq hielans (2) - 17 freq fillan (2) - 8 freq milns (2) - 1 freq fillan's (2) - 1 freq midlands (2) - 3 freq mellins (2) - 1 freq killan (2) - 2 freq millar (2) - 11 freq pillaes (2) - 7 freq mills (2) - 33 freq ullans (2) - 32 freq muirlans (2) - 1 freq milling (2) - 1 freq hallans (2) - 1 freq pillas (2) - 3 freq villains (2) - 3 freq shillans (2) - 2 freq gillan (2) - 5 freq |
millans (0) - 1 freq millins (1) - 1 freq mellins (2) - 1 freq willans (2) - 1 freq millions (2) - 66 freq millan (2) - 1 freq lallans (3) - 136 freq killins (3) - 1 freq hallans (3) - 1 freq milling (3) - 1 freq villains (3) - 3 freq fillins (3) - 2 freq millies (3) - 1 freq mallaes (3) - 1 freq mullan (3) - 2 freq muirlans (3) - 1 freq millin (3) - 6 freq mill's (3) - 2 freq gillians (3) - 1 freq milns (3) - 1 freq ullans (3) - 32 freq mills (3) - 33 freq melons (4) - 2 freq macleans (4) - 1 freq millenia (4) - 3 freq |
SoundEx code - M452 millions - 66 freq melancholy - 15 freq 'millions - 2 freq malink - 2 freq mealmaker - 5 freq malunch - 1 freq melancholic - 2 freq milngavie - 1 freq mellins - 1 freq milne's - 1 freq mallimaks - 1 freq millins - 1 freq malinconia - 1 freq malinky - 1 freq malinkies - 1 freq mailins - 1 freq mailing - 3 freq melons - 2 freq millans - 1 freq milns - 1 freq malinger - 1 freq maleness - 1 freq milling - 1 freq mwilliamsht - 9 freq |
MetaPhone code - MLNS millions - 66 freq 'millions - 2 freq mellins - 1 freq milne's - 1 freq millins - 1 freq mailins - 1 freq melons - 2 freq millans - 1 freq milns - 1 freq maleness - 1 freq |
MILLANS |
| Time to execute Levenshtein function - 0.210220 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.394914 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.028565 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.037741 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.000937 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. |