Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
paisly (0) - 1 freq paisley (1) - 61 freq paisty (1) - 1 freq paisely (1) - 2 freq pairl (2) - 3 freq primly (2) - 1 freq puirly (2) - 3 freq graisly (2) - 1 freq maisty (2) - 2 freq yaishly (2) - 1 freq pais (2) - 3 freq waikly (2) - 3 freq pails (2) - 14 freq fairly (2) - 235 freq railly (2) - 1 freq 'paisley (2) - 1 freq vainly (2) - 3 freq partly (2) - 10 freq paiy (2) - 8 freq prissy (2) - 1 freq pairtly (2) - 15 freq nairly (2) - 1 freq plainly (2) - 9 freq laistly (2) - 2 freq saifly (2) - 1 freq |
paisly (0) - 1 freq paisely (1) - 2 freq paisley (1) - 61 freq paisty (2) - 1 freq pishy (3) - 8 freq daisley (3) - 2 freq paidle (3) - 1 freq piously (3) - 3 freq aisily (3) - 1 freq paill (3) - 1 freq patsley (3) - 1 freq pisky (3) - 1 freq 'paisley (3) - 1 freq presly (3) - 2 freq pilly (3) - 1 freq parsley (3) - 8 freq paised (3) - 4 freq puirly (3) - 3 freq pally (3) - 12 freq pairl (3) - 3 freq pasty (3) - 1 freq paist (3) - 1 freq parly (3) - 2 freq pail (3) - 50 freq aisle (3) - 27 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 |
PAISLY |
Time to execute Levenshtein function - 0.200497 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.382791 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.027957 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.038064 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.004270 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. |