| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| passover (0) - 3 freq passower (1) - 9 freq pass-ower (2) - 1 freq passive (2) - 9 freq passes (3) - 70 freq passowre (3) - 7 freq passeen (3) - 3 freq massive (3) - 83 freq nasser (3) - 1 freq padster (3) - 1 freq pastor (3) - 1 freq discover (3) - 32 freq posster (3) - 1 freq takeover (3) - 2 freq allover (3) - 3 freq palaver (3) - 10 freq sasser (3) - 11 freq pals've (3) - 1 freq plover (3) - 9 freq passenger (3) - 24 freq passively (3) - 2 freq passed (3) - 314 freq crossover (3) - 1 freq sover (3) - 1 freq pullover (3) - 1 freq |
passover (0) - 3 freq passower (2) - 9 freq passive (3) - 9 freq passero (4) - 1 freq posster (4) - 1 freq passively (4) - 2 freq passowre (4) - 7 freq pass-ower (4) - 1 freq passages (5) - 8 freq passage (5) - 60 freq sover (5) - 1 freq passinjer (5) - 2 freq pullover (5) - 1 freq passen (5) - 2 freq asseer (5) - 1 freq panser (5) - 26 freq persevere (5) - 11 freq palaiver (5) - 2 freq crossover (5) - 1 freq lassve (5) - 1 freq passanger (5) - 1 freq prisoner (5) - 35 freq wasser (5) - 1 freq padster (5) - 1 freq passeen (5) - 3 freq |
SoundEx code - P216 pig-fermer - 1 freq pig-bairn - 2 freq phosphor - 1 freq passport - 16 freq passports - 8 freq passportin - 2 freq 'passports' - 1 freq phosphorescent - 1 freq passpartout'd - 1 freq passover - 3 freq passkeeper's - 1 freq phosporus - 1 freq phosphorus - 1 freq pasport - 5 freq pasports - 1 freq passpoorts - 1 freq px-princepotemkinnobleman - 1 freq piesportsscot - 1 freq pxpurt - 1 freq |
MetaPhone code - PSFR passover - 3 freq |
PASSOVER |
| Time to execute Levenshtein function - 0.209904 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.345117 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.027919 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.037179 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.000870 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. |