| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| paddyb (0) - 1 freq paddy (1) - 25 freq paddin (2) - 2 freq laddy (2) - 1 freq paddy's (2) - 2 freq padded (2) - 13 freq teddyb (2) - 1 freq daddy (2) - 140 freq paddle (2) - 23 freq caddy (2) - 2 freq baddy (2) - 1 freq maddy (2) - 4 freq addy (2) - 6 freq paddit (2) - 2 freq paddilt (3) - 2 freq adda (3) - 4 freq dadd (3) - 2 freq peedy (3) - 121 freq reddy (3) - 17 freq paceys (3) - 1 freq pathy (3) - 1 freq paidle (3) - 1 freq paiddle (3) - 2 freq caddis (3) - 1 freq waddin (3) - 96 freq |
paddyb (0) - 1 freq paddy (2) - 25 freq paddle (3) - 23 freq teddyb (3) - 1 freq padded (3) - 13 freq paddin (3) - 2 freq paddit (3) - 2 freq puddle (4) - 26 freq pedd (4) - 1 freq paiddle (4) - 2 freq puddil (4) - 1 freq pudden (4) - 22 freq piddle (4) - 3 freq puddok (4) - 1 freq peddul (4) - 1 freq puddin (4) - 31 freq daddy (4) - 140 freq paddy's (4) - 2 freq laddy (4) - 1 freq caddy (4) - 2 freq baddy (4) - 1 freq maddy (4) - 4 freq addy (4) - 6 freq padme (5) - 1 freq hadden (5) - 3 freq |
SoundEx code - P310 peetifu - 3 freq peyed-up - 1 freq pityfu - 2 freq potfu - 1 freq peitifu - 1 freq peedv - 1 freq pot-de-feu - 1 freq pdf - 37 freq peitie-fu - 1 freq pit-by - 1 freq peitifou - 1 freq paddyb - 1 freq ptyf - 1 freq pidpu - 1 freq pdp - 1 freq pdyafw - 1 freq peedieboy - 1 freq |
MetaPhone code - PTB pit-by - 1 freq paddyb - 1 freq peedieboy - 1 freq |
PADDYB |
| Time to execute Levenshtein function - 0.186172 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.376615 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.027649 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.037769 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.001078 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. |