| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| shairly (0) - 107 freq 'shairly (1) - 1 freq sairly (1) - 28 freq shuirly (1) - 33 freq shairply (1) - 15 freq shairny (1) - 2 freq ssairly (1) - 1 freq shürly (2) - 1 freq 'hairy (2) - 2 freq shair's (2) - 1 freq swirly (2) - 2 freq rairly (2) - 1 freq hairry (2) - 1 freq shairn (2) - 17 freq fairly (2) - 233 freq clairly (2) - 2 freq 'fairly (2) - 2 freq shrilly (2) - 1 freq shairds (2) - 5 freq saifly (2) - 1 freq shirley (2) - 9 freq harly (2) - 13 freq nairly (2) - 1 freq slairgy (2) - 1 freq hairdly (2) - 55 freq |
shairly (0) - 107 freq shuirly (1) - 33 freq shairlie (2) - 7 freq shirley (2) - 9 freq ssairly (2) - 1 freq shurly (2) - 16 freq shairply (2) - 15 freq shairny (2) - 2 freq 'shairly (2) - 1 freq sairly (2) - 28 freq shirty (3) - 1 freq haurly (3) - 16 freq skirly (3) - 19 freq sharlie (3) - 1 freq sharny (3) - 7 freq sharply (3) - 7 freq shaired (3) - 3 freq shairin (3) - 2 freq shapely (3) - 2 freq shair (3) - 445 freq shairer (3) - 1 freq shuirlie (3) - 38 freq shaire (3) - 8 freq shairn (3) - 17 freq shurely (3) - 3 freq |
SoundEx code - S640 shairly - 107 freq skirl - 45 freq surely - 179 freq sairlie - 6 freq shrill - 20 freq scroll - 20 freq swurl - 4 freq 'shairly - 1 freq suirly - 5 freq serial - 3 freq seerly - 13 freq shuirly - 33 freq sairly - 28 freq swirl - 16 freq swirly - 2 freq soarely - 1 freq shuirlie - 38 freq sarely - 1 freq shirley - 9 freq scrawl - 7 freq ssairly - 1 freq surly - 3 freq sorley - 2 freq shurely - 3 freq squirrel - 43 freq surreal - 8 freq 'surely - 3 freq 'sharley' - 1 freq shairlie - 7 freq squarely - 3 freq skirlie - 10 freq shurley - 6 freq scroil - 1 freq shurly - 16 freq skeerily - 8 freq soorly - 3 freq skeerly - 1 freq surely-i - 1 freq shrrhole - 1 freq srella - 1 freq shürly - 1 freq sjörlie - 2 freq surreally - 1 freq skurrel - 1 freq sweerly - 1 freq surley - 3 freq shrilly - 1 freq sharlie - 1 freq skerl - 1 freq €œsurely - 3 freq skirly - 19 freq €˜shuirly - 1 freq sirely - 1 freq sorely - 2 freq sheurlee - 1 freq skerla - 1 freq swurly - 1 freq sorrel - 1 freq |
MetaPhone code - XRL shairly - 107 freq shrill - 20 freq 'shairly - 1 freq cherlie - 133 freq shuirly - 33 freq chairlie - 273 freq shuirlie - 38 freq cheerily - 5 freq shirley - 9 freq charlie - 88 freq choral - 2 freq shurely - 3 freq churl - 1 freq 'sharley' - 1 freq charley - 1 freq shairlie - 7 freq 'chairlie - 5 freq 'charlie - 2 freq shurley - 6 freq shurly - 16 freq chairlie' - 1 freq shürly - 1 freq cheerly - 1 freq charle - 1 freq charhle - 1 freq chaurlie - 1 freq 'cherlie' - 1 freq cherlie' - 1 freq shrilly - 1 freq sharlie - 1 freq chorale - 1 freq €˜shuirly - 1 freq €œcharlie - 1 freq sheurlee - 1 freq cheryl - 1 freq |
SHAIRLY |
| Time to execute Levenshtein function - 0.321954 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.601119 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.028035 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.072924 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.000833 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. |