| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pell-mell (0) - 2 freq dellbell (3) - 1 freq pennywell (4) - 1 freq hell-hole (4) - 1 freq pensell (4) - 2 freq well-bein (4) - 2 freq hell-bent (4) - 2 freq well-kept (4) - 1 freq ellemcelle (4) - 1 freq jyle-cell (4) - 1 freq pellets (4) - 5 freq well-kend (4) - 1 freq melzmelz (4) - 1 freq ill-will (4) - 6 freq perlament (4) - 8 freq bellshill (4) - 2 freq wellhill (4) - 1 freq tell-tale (4) - 2 freq ill-wull (4) - 5 freq kell-heid (4) - 1 freq self-help (4) - 3 freq hill-men (4) - 7 freq weel-tellt (4) - 2 freq philomela (4) - 3 freq ull-wull (4) - 2 freq |
pell-mell (0) - 2 freq ill-wull (6) - 5 freq till-till (6) - 1 freq ill-will (6) - 6 freq ull-wull (6) - 2 freq dellbell (6) - 1 freq hill-men (7) - 7 freq wellhill (7) - 1 freq tell-tale (7) - 2 freq philomela (7) - 3 freq ill-willy (7) - 3 freq reel-rall (7) - 2 freq nellie'll (7) - 1 freq bellshill (7) - 2 freq hell-hole (7) - 1 freq ellemcelle (7) - 1 freq peely-wally (7) - 19 freq jyle-cell (7) - 1 freq bull-man (8) - 1 freq 'ally-bally (8) - 1 freq pillls (8) - 1 freq plimsoll (8) - 2 freq ill-wul (8) - 1 freq ellonwill (8) - 2 freq kellymillen (8) - 1 freq |
SoundEx code - P454 plainly - 9 freq pell-mell - 2 freq poulmoleen - 1 freq palmolive - 1 freq plenly - 1 freq philomela - 3 freq paulmalgrati - 8 freq |
MetaPhone code - PLML pell-mell - 2 freq |
PELL-MELL |
| Time to execute Levenshtein function - 0.192081 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.405864 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.027799 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.068625 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.000855 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. |