| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pickles (0) - 2 freq pirckles (1) - 1 freq fickles (1) - 1 freq tickles (1) - 5 freq pickle (1) - 30 freq puckles (1) - 14 freq pickled (1) - 10 freq rickles (1) - 3 freq prickles (1) - 2 freq pimples (2) - 3 freq buckles (2) - 1 freq pickl't (2) - 1 freq pinkies (2) - 3 freq huckles (2) - 1 freq mickle (2) - 13 freq speckles (2) - 1 freq hackles (2) - 3 freq trickles (2) - 3 freq picked (2) - 185 freq picklin (2) - 2 freq pikes (2) - 8 freq kuckles (2) - 1 freq pickins (2) - 5 freq prickle (2) - 1 freq piles (2) - 26 freq |
pickles (0) - 2 freq puckles (1) - 14 freq pickled (2) - 10 freq rickles (2) - 3 freq pucklies (2) - 4 freq prickles (2) - 2 freq pickle (2) - 30 freq fickles (2) - 1 freq pirckles (2) - 1 freq tickles (2) - 5 freq keckles (3) - 2 freq ruckles (3) - 1 freq pickets (3) - 3 freq picks (3) - 26 freq pick's (3) - 1 freq cackles (3) - 1 freq packle (3) - 1 freq pockle (3) - 1 freq cockles (3) - 6 freq puckle (3) - 314 freq yackles (3) - 1 freq pickloo (3) - 1 freq pockies (3) - 1 freq muckles (3) - 1 freq tackles (3) - 3 freq |
SoundEx code - P242 puggie-like - 1 freq possels - 8 freq 'possels' - 1 freq pixels - 2 freq paisley's - 2 freq puzzles-ah - 1 freq puzzles - 3 freq puckles - 14 freq pschological - 1 freq pauciloquent - 1 freq pucklies - 4 freq pawkie-lik - 1 freq physiologic - 2 freq pickles - 2 freq physiology - 1 freq |
MetaPhone code - PKLS puckles - 14 freq pucklies - 4 freq pickles - 2 freq |
PICKLES |
| Time to execute Levenshtein function - 0.213072 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.366674 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.028594 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.039606 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.001065 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. |