| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pascal (0) - 1 freq rascal (1) - 5 freq parcel (2) - 45 freq papal (2) - 5 freq rascals (2) - 1 freq panoal (2) - 1 freq vassal (2) - 1 freq mescal (2) - 1 freq pasta (2) - 14 freq pastel (2) - 2 freq fiscal (2) - 5 freq pasna (2) - 1 freq casual (2) - 22 freq pastas (2) - 1 freq nasal (2) - 9 freq paal (2) - 2 freq pasche (2) - 1 freq postal (2) - 3 freq passan (2) - 7 freq nascar (2) - 2 freq masala (3) - 1 freq past (3) - 836 freq racial (3) - 14 freq packa (3) - 1 freq focal (3) - 2 freq |
pascal (0) - 1 freq rascal (2) - 5 freq mescal (3) - 1 freq fiscal (3) - 5 freq pasche (3) - 1 freq parcel (3) - 45 freq postal (3) - 3 freq pastel (3) - 2 freq psml (4) - 23 freq scl (4) - 1 freq pistol (4) - 28 freq pskl (4) - 1 freq saicl (4) - 1 freq pencil (4) - 42 freq pincil (4) - 22 freq pisces (4) - 3 freq pixcel (4) - 2 freq pasabil (4) - 1 freq scol (4) - 1 freq scaal (4) - 1 freq pasquale (4) - 3 freq scaly (4) - 13 freq musical (4) - 41 freq miscaal (4) - 1 freq peecial (4) - 1 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 - PSKL pasquale - 3 freq pascal - 1 freq pwzcl - 1 freq pskl - 1 freq |
PASCAL |
| Time to execute Levenshtein function - 0.277806 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.415654 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.029510 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.039190 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.000905 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. |