| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| paisely (0) - 2 freq paisly (1) - 1 freq yaishly (2) - 1 freq taiselt (2) - 1 freq pairtly (2) - 15 freq paised (2) - 4 freq paisty (2) - 1 freq aisily (2) - 1 freq laistly (2) - 2 freq fausely (2) - 1 freq wisely (2) - 8 freq easely (2) - 1 freq paisley (2) - 61 freq maistly (2) - 226 freq gaistly (2) - 1 freq mainly (3) - 40 freq maisty (3) - 2 freq poised (3) - 7 freq closely (3) - 21 freq haimelt (3) - 5 freq railly (3) - 1 freq pacey (3) - 384 freq noisily (3) - 9 freq parsley (3) - 8 freq panels (3) - 15 freq |
paisely (0) - 2 freq paisly (1) - 1 freq paisley (2) - 61 freq wisely (3) - 8 freq easely (3) - 1 freq aisily (3) - 1 freq fausely (3) - 1 freq paisty (3) - 1 freq paised (3) - 4 freq hisel (4) - 18 freq loosely (4) - 5 freq pavel (4) - 1 freq purely (4) - 16 freq paill (4) - 1 freq masel (4) - 1037 freq maisiel (4) - 1 freq casel (4) - 1 freq pais (4) - 3 freq patsley (4) - 1 freq piously (4) - 3 freq 'paisley (4) - 1 freq pael (4) - 2 freq pause (4) - 62 freq weasely (4) - 1 freq pishy (4) - 8 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 - PSL puzzle - 21 freq paisley - 61 freq piously - 3 freq paisly - 1 freq 'paisley - 1 freq paisely - 2 freq ypzle - 1 freq |
PAISELY |
| Time to execute Levenshtein function - 0.191631 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.395028 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.030684 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.043702 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.001068 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. |