| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| millennium (0) - 17 freq millenium (1) - 3 freq millennia (2) - 4 freq millennial (2) - 2 freq 'millenium (2) - 1 freq millenium's (3) - 1 freq millennial' (3) - 1 freq millenia (3) - 3 freq milleen (4) - 1 freq miskennin (4) - 3 freq milketrum (4) - 1 freq millionth (5) - 3 freq mienin (5) - 1 freq kilrenny (5) - 1 freq mire-drum (5) - 2 freq millie (5) - 5 freq silencin (5) - 3 freq linannlum (5) - 2 freq kilkenny (5) - 1 freq millionaire (5) - 7 freq millins (5) - 1 freq lennie (5) - 4 freq mysterium (5) - 1 freq willni (5) - 2 freq medium (5) - 71 freq |
millennium (0) - 17 freq millenium (2) - 3 freq millennial (3) - 2 freq millennia (3) - 4 freq 'millenium (4) - 1 freq millennial' (5) - 1 freq millenia (5) - 3 freq millenium's (6) - 1 freq milleen (6) - 1 freq uilleann (7) - 1 freq mallum (7) - 1 freq mullen (7) - 1 freq millionare (7) - 1 freq millin (7) - 6 freq million (7) - 156 freq milling (7) - 1 freq mclennan (7) - 10 freq uxelledonium (7) - 1 freq millpond (7) - 1 freq millden (7) - 1 freq millions (7) - 66 freq millans (7) - 1 freq millan (7) - 1 freq millionaire (7) - 7 freq millionth (7) - 3 freq |
SoundEx code - M455 millennium - 17 freq millenium's - 1 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.196281 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.378264 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.028440 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.038667 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.000889 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. |