| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| puddockflunkie (0) - 1 freq puddock-stuil (6) - 3 freq fush-flunkie (6) - 2 freq puddock-stool (7) - 1 freq puddock-stools (7) - 1 freq paddock-stuil (7) - 1 freq puddock-eed (7) - 1 freq puddocks' (7) - 1 freq paddok-loks (7) - 1 freq cockaleekie (7) - 1 freq publicklie (7) - 1 freq pucklie (7) - 35 freq puddock-stuils (7) - 2 freq puddock (7) - 34 freq puddock's (7) - 2 freq puddocks (7) - 25 freq flunkie (7) - 11 freq pockle (8) - 1 freq huddock (8) - 6 freq pickmirkie (8) - 1 freq suddentie (8) - 13 freq rocklie (8) - 1 freq cockieleekie (8) - 1 freq puddle (8) - 26 freq frock-like (8) - 1 freq |
puddockflunkie (0) - 1 freq puddock-stuil (10) - 3 freq paddok-loks (11) - 1 freq puddock's (11) - 2 freq puddocks (11) - 25 freq puddocks' (11) - 1 freq puddock (11) - 34 freq puddock-stool (11) - 1 freq puddock-eed (11) - 1 freq paddock-stuil (11) - 1 freq fush-flunkie (11) - 2 freq flunkie (12) - 11 freq puddlin (12) - 1 freq paddock's (12) - 1 freq puddock-stools (12) - 1 freq cockaleekie (12) - 1 freq publicklie (12) - 1 freq pucklie (12) - 35 freq perfeck-like (12) - 1 freq puddock-stuils (12) - 2 freq pock-neuk (13) - 1 freq sudden-like (13) - 1 freq quick-like (13) - 2 freq paddick (13) - 1 freq eddieclarke (13) - 1 freq |
SoundEx code - P321 pots-buta - 1 freq pit-cowp - 1 freq puddockflunkie - 1 freq pittsburgh - 3 freq pitchfork - 1 freq photocopyin - 2 freq pitch-black - 1 freq patch-bay - 1 freq photocoapie - 1 freq photocopiers - 1 freq photo-copier - 1 freq pitchforks - 3 freq pitch-perfeck - 1 freq phdtkpt - 1 freq pdtasfh - 1 freq photocopier - 1 freq photoshop - 1 freq photo-shopped - 1 freq pfptcvc - 1 freq |
MetaPhone code - PTKFLNK puddockflunkie - 1 freq |
PUDDOCKFLUNKIE |
| Time to execute Levenshtein function - 0.229753 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.428990 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.029572 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.038249 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.000892 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. |