| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| première (0) - 1 freq premièred (1) - 1 freq premier (3) - 7 freq premature (3) - 7 freq premiered (3) - 1 freq treisure (4) - 19 freq primitive (4) - 4 freq pleisure (4) - 60 freq retire (4) - 11 freq prepare (4) - 24 freq predicate (4) - 11 freq preissure (4) - 1 freq preshure (4) - 1 freq premeese (4) - 1 freq rewire (4) - 2 freq preive (4) - 1 freq precipice (4) - 3 freq remine (4) - 2 freq petèr (4) - 31 freq plentèrs (4) - 1 freq premium (4) - 2 freq bergère (4) - 1 freq gruyère (4) - 1 freq premises (4) - 14 freq precise (4) - 14 freq |
première (0) - 1 freq premièred (2) - 1 freq premature (5) - 7 freq premier (5) - 7 freq petèr (6) - 31 freq bergère (6) - 1 freq gruyère (6) - 1 freq premiered (6) - 1 freq promise (7) - 119 freq pressure (7) - 64 freq molière (7) - 22 freq promiese (7) - 1 freq problème (7) - 2 freq preclare (7) - 2 freq premises (7) - 14 freq primer (7) - 10 freq peremptor (7) - 2 freq pictèr (7) - 3 freq primary (7) - 173 freq primarie (7) - 3 freq primar (7) - 1 freq preemary (7) - 1 freq promissory (7) - 1 freq peremptory (7) - 1 freq preshure (7) - 1 freq |
SoundEx code - P656 primary - 173 freq primrose - 13 freq premièred - 1 freq première - 1 freq primaries - 4 freq 'primary - 1 freq prime-rib - 1 freq primar - 1 freq primark - 6 freq primroses - 3 freq primordial - 1 freq premier - 7 freq primer - 10 freq pre-norse - 1 freq paramour - 1 freq primarie - 3 freq paranormal - 1 freq premiered - 1 freq preemary - 1 freq primarily - 2 freq premiership - 2 freq premiersportstv - 3 freq |
MetaPhone code - PRMR primary - 173 freq première - 1 freq 'primary - 1 freq primar - 1 freq premier - 7 freq primer - 10 freq paramour - 1 freq primarie - 3 freq preemary - 1 freq |
PREMIÈRE |
| Time to execute Levenshtein function - 0.208604 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.343356 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.027365 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.045703 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.001303 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. |