Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
pencil (0) - 41 freq pencils (1) - 9 freq pincil (1) - 22 freq pendil (1) - 9 freq penel (2) - 106 freq pennie (2) - 6 freq pentid (2) - 1 freq pence (2) - 63 freq tencel (2) - 1 freq pincils (2) - 2 freq pentit (2) - 44 freq pendils (2) - 1 freq pensin (2) - 3 freq peril (2) - 7 freq pencil's (2) - 1 freq poncin (2) - 1 freq penal (2) - 5 freq pecl (2) - 1 freq persil (2) - 1 freq fencin (2) - 1 freq pennin (2) - 2 freq lentil (2) - 5 freq stencil (2) - 1 freq pendin (2) - 3 freq penim (2) - 1 freq |
pencil (0) - 41 freq pincil (1) - 22 freq pencils (2) - 9 freq pendil (2) - 9 freq pecl (3) - 1 freq penal (3) - 5 freq poncin (3) - 1 freq peecial (3) - 1 freq pences (3) - 3 freq pensel (3) - 1 freq poneil (3) - 3 freq tencel (3) - 1 freq penel (3) - 106 freq pincils (3) - 2 freq pence (3) - 63 freq panic (4) - 65 freq incel (4) - 1 freq pendicle (4) - 5 freq pascal (4) - 1 freq panel (4) - 29 freq council (4) - 58 freq pinch (4) - 21 freq cancel (4) - 6 freq parcel (4) - 38 freq poncho (4) - 2 freq |
SoundEx code - P524 phone-calls - 1 freq pencil - 41 freq pencils'd - 1 freq pingle - 2 freq pincil - 22 freq pincils - 2 freq pencils - 9 freq penjulim - 1 freq painkillers - 3 freq penicillin - 5 freq pencil-box - 3 freq pencil-case - 5 freq pensie-lik - 1 freq pingils - 1 freq pencilthin - 1 freq phonecalls - 1 freq pinklin - 2 freq pensie-like - 1 freq pensell - 2 freq pensells - 3 freq pensel - 1 freq phone-caals - 1 freq phone-caal - 1 freq pennsylvania - 1 freq pingle-pan - 1 freq pingilt - 1 freq pencil's - 1 freq phonecall - 2 freq pinnacle - 1 freq panglish - 1 freq punchline - 2 freq pinglin - 1 freq pencil-shapit - 1 freq phone-call - 1 freq pan-slavic - 1 freq pengelly - 3 freq pmacgiollabhain - 1 freq painkiller - 1 freq |
MetaPhone code - PNSL pencil - 41 freq pincil - 22 freq pensell - 2 freq pensel - 1 freq |
PENCIL |
Time to execute Levenshtein function - 0.204286 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.348882 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.027353 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.036583 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.000832 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. |