Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
pecl (0) - 1 freq peal (1) - 3 freq peel (1) - 41 freq pewl (1) - 3 freq recl (1) - 1 freq pece (1) - 9 freq pecr (1) - 1 freq pell (1) - 4 freq peck (1) - 20 freq pech (1) - 35 freq fecl (1) - 1 freq eec (2) - 2 freq lec (2) - 1 freq feal (2) - 1 freq pics (2) - 12 freq sel (2) - 75 freq eece (2) - 8 freq leck (2) - 27 freq ell (2) - 1 freq pecks (2) - 1 freq pep (2) - 3 freq peek (2) - 12 freq perv (2) - 3 freq perce (2) - 1 freq pirl (2) - 7 freq |
pecl (0) - 1 freq pell (2) - 4 freq pech (2) - 35 freq pcly (2) - 1 freq pecr (2) - 1 freq fecl (2) - 1 freq peck (2) - 20 freq peel (2) - 41 freq peal (2) - 3 freq pece (2) - 9 freq pewl (2) - 3 freq recl (2) - 1 freq pace (3) - 77 freq pol (3) - 4 freq pgl (3) - 1 freq pal (3) - 508 freq paal (3) - 2 freq poal (3) - 1 freq peice (3) - 1 freq hecla (3) - 4 freq paece (3) - 54 freq peace (3) - 269 freq pail (3) - 50 freq scl (3) - 1 freq pele (3) - 17 freq |
SoundEx code - P240 puckle - 316 freq pauchle - 20 freq puzzle - 21 freq pockle - 1 freq puggle - 1 freq paisley - 61 freq pucklie - 35 freq pecl - 1 freq pickle - 30 freq pukkul - 5 freq pasquale - 3 freq poochle - 2 freq pascal - 1 freq peecial - 1 freq pig'll - 1 freq pukkil - 5 freq pickloo - 1 freq pawkle - 1 freq pawkily - 2 freq piously - 3 freq paisly - 1 freq pixcel - 2 freq pikkil - 2 freq 'paisley - 1 freq pukklie - 1 freq pochil - 1 freq paisely - 2 freq puekle - 1 freq pawkiely - 1 freq puckly - 12 freq pwzcl - 1 freq pgl - 1 freq pskl - 1 freq packle - 1 freq pbzl - 1 freq pcly - 1 freq phacelia - 1 freq |
MetaPhone code - PKL puckle - 316 freq pockle - 1 freq puggle - 1 freq pucklie - 35 freq pecl - 1 freq pickle - 30 freq pukkul - 5 freq pig'll - 1 freq pukkil - 5 freq pickloo - 1 freq pawkle - 1 freq pawkily - 2 freq pikkil - 2 freq pukklie - 1 freq puekle - 1 freq pawkiely - 1 freq puckly - 12 freq pgl - 1 freq packle - 1 freq pcly - 1 freq |
PECL |
Time to execute Levenshtein function - 0.300654 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.606197 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.028130 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.072868 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.000922 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. |