| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| paisley (0) - 61 freq daisley (1) - 2 freq paisly (1) - 1 freq parsley (1) - 8 freq patsley (1) - 1 freq 'paisley (1) - 1 freq paidle (2) - 1 freq paibles (2) - 1 freq aisle (2) - 26 freq paidlet (2) - 1 freq paisely (2) - 2 freq paised (2) - 4 freq paisty (2) - 1 freq fairley (2) - 1 freq vailey (2) - 5 freq taislet (2) - 2 freq presley (2) - 1 freq isley (2) - 1 freq taisled (2) - 1 freq aisles (2) - 3 freq paidled (2) - 1 freq maislee (2) - 12 freq vailley (2) - 6 freq paisley's (2) - 2 freq piley (2) - 1 freq |
paisley (0) - 61 freq paisly (1) - 1 freq paisely (2) - 2 freq patsley (2) - 1 freq 'paisley (2) - 1 freq daisley (2) - 2 freq parsley (2) - 8 freq presley (3) - 1 freq piley (3) - 1 freq isley (3) - 1 freq paisty (3) - 1 freq maislee (3) - 12 freq paised (3) - 4 freq aisle (3) - 26 freq paidle (3) - 1 freq pale (4) - 86 freq apashley (4) - 4 freq islay (4) - 4 freq pauses (4) - 8 freq pally (4) - 12 freq paste (4) - 10 freq isle (4) - 81 freq pile (4) - 110 freq pail (4) - 49 freq pasty (4) - 1 freq |
SoundEx code - P240 puckle - 314 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 |
PAISLEY |
| Time to execute Levenshtein function - 0.184579 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.328257 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.027142 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.036374 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.000790 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. |