| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| piddlin (0) - 2 freq peddlin (1) - 6 freq fiddlin (1) - 5 freq paiddlin (1) - 4 freq middlin (1) - 10 freq riddlin (1) - 1 freq diddlin (1) - 2 freq hiddlin (1) - 4 freq puddlin (1) - 1 freq paddlin (1) - 5 freq widdin (2) - 4 freq pilin (2) - 9 freq guddlin (2) - 11 freq skiddlin (2) - 2 freq hiddlie (2) - 5 freq pinglin (2) - 1 freq pinklin (2) - 2 freq piddled (2) - 1 freq hoddlin (2) - 1 freq waddlin (2) - 2 freq hidlin (2) - 1 freq twiddlin (2) - 2 freq coddlin (2) - 1 freq kiddin (2) - 70 freq hiddin (2) - 1 freq |
piddlin (0) - 2 freq peddlin (1) - 6 freq paddlin (1) - 5 freq puddlin (1) - 1 freq paiddlin (1) - 4 freq riddlin (2) - 1 freq paddelin (2) - 1 freq middlin (2) - 10 freq fiddlin (2) - 5 freq hiddlin (2) - 4 freq diddlin (2) - 2 freq piddles (3) - 4 freq piddle (3) - 3 freq meddlin (3) - 5 freq paddling (3) - 3 freq puddin (3) - 31 freq coddlin (3) - 1 freq cuddlin (3) - 4 freq pedlin (3) - 1 freq toddlin (3) - 2 freq paidlin (3) - 1 freq paddin (3) - 2 freq waddlin (3) - 2 freq hoddlin (3) - 1 freq guddlin (3) - 11 freq |
SoundEx code - P345 paidlin - 1 freq paddlin - 5 freq peddlin - 6 freq puddlin - 1 freq piddlin - 2 freq ptolemy's - 1 freq paiddlin - 4 freq pedlin - 1 freq ptolemy - 1 freq pedallin - 1 freq paddelin - 1 freq petulantly - 1 freq paddling - 3 freq peedlum - 1 freq |
MetaPhone code - PTLN paidlin - 1 freq paddlin - 5 freq peddlin - 6 freq puddlin - 1 freq piddlin - 2 freq paiddlin - 4 freq pedlin - 1 freq pedallin - 1 freq paddelin - 1 freq |
PIDDLIN |
| Time to execute Levenshtein function - 0.321425 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.532275 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.061018 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.037152 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.000927 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. |