| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| millennium (0) - 17 freq millenium (1) - 3 freq 'millenium (2) - 1 freq millennia (2) - 4 freq millennial (2) - 2 freq millennial' (3) - 1 freq millenia (3) - 2 freq miskennin (4) - 3 freq milketrum (4) - 1 freq milleen (4) - 1 freq killen (5) - 4 freq millpond (5) - 1 freq mennin (5) - 3 freq millans (5) - 1 freq kilkenny (5) - 1 freq midleen (5) - 1 freq millions (5) - 66 freq mackennie (5) - 1 freq titanium (5) - 2 freq intennin (5) - 1 freq mirkenin (5) - 5 freq alumeinium (5) - 2 freq minimum (5) - 14 freq william (5) - 238 freq palladium (5) - 1 freq |
millennium (0) - 17 freq millenium (2) - 3 freq millennial (3) - 2 freq millennia (3) - 4 freq 'millenium (4) - 1 freq millenia (5) - 2 freq millennial' (5) - 1 freq milleen (6) - 1 freq mullen (7) - 1 freq milling (7) - 1 freq millionaire (7) - 6 freq millan (7) - 1 freq millden (7) - 1 freq mallum (7) - 1 freq millionare (7) - 1 freq millins (7) - 1 freq mclennan (7) - 10 freq millionth (7) - 3 freq millin (7) - 6 freq million (7) - 155 freq uxelledonium (7) - 1 freq milketrum (7) - 1 freq millans (7) - 1 freq millions (7) - 66 freq miskennin (7) - 3 freq |
SoundEx code - M455 millennium - 17 freq 'millenium - 1 freq maelamine - 1 freq millenium - 3 freq meal-mongers - 1 freq |
MetaPhone code - MLNM millennium - 17 freq 'millenium - 1 freq millenium - 3 freq |
MILLENNIUM |
| Time to execute Levenshtein function - 0.585763 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.826268 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.067322 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.037874 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.000797 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. |