| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| peelie-wally (0) - 6 freq peeliewally (1) - 11 freq peelie-wallie (2) - 15 freq peely-wally (2) - 19 freq peeliewallie (3) - 10 freq peelywally (3) - 1 freq deely-dally (4) - 1 freq peely-wallie (4) - 1 freq peelywaaly (4) - 1 freq peelie-wallie (4) - 1 freq eheswally (5) - 1 freq reel-rall (5) - 2 freq teenie-weeny (5) - 1 freq leeterally (5) - 2 freq politically (5) - 6 freq pheesically (5) - 1 freq peetifully (5) - 2 freq peerie-wyes (5) - 22 freq peerie-wee (5) - 12 freq publically (5) - 1 freq peesie-weeps (5) - 1 freq eeswally (5) - 4 freq jeelie-lip (5) - 1 freq reeeally (5) - 1 freq weel-waled (5) - 1 freq |
peelie-wally (0) - 6 freq peelie-wallie (2) - 15 freq peely-wally (2) - 19 freq peeliewally (2) - 11 freq peely-wallie (4) - 1 freq peelywally (4) - 1 freq peeliewallie (4) - 10 freq peelywaaly (6) - 1 freq peelie-wallie (6) - 1 freq deely-dally (6) - 1 freq politically (7) - 6 freq ill-willy (7) - 3 freq weel-waled (7) - 1 freq uilliewall (7) - 1 freq palsy-walsy (7) - 1 freq reel-rall (7) - 2 freq pierowall (8) - 1 freq pell-mell (8) - 2 freq poleitically (8) - 2 freq ill-will (8) - 6 freq palsywalsy (8) - 1 freq ill-wull (8) - 5 freq ull-wull (8) - 2 freq poleetically (8) - 1 freq allie-ballie (8) - 2 freq |
SoundEx code - P440 peely-wally - 19 freq peelie-wally - 6 freq peelie-wallie - 15 freq peeliewallie - 10 freq peeliewally - 11 freq peelie-wallie - 1 freq peely-wallie - 1 freq peelywally - 1 freq plul - 1 freq peelywaaly - 1 freq |
MetaPhone code - PLWL peely-wally - 19 freq peelie-wally - 6 freq peelie-wallie - 15 freq peeliewallie - 10 freq peeliewally - 11 freq peelie-wallie - 1 freq peely-wallie - 1 freq peelywally - 1 freq peelywaaly - 1 freq |
PEELIE-WALLY |
| Time to execute Levenshtein function - 0.191655 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.347328 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.027384 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.037192 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.000819 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. |