| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| solihull (0) - 1 freq solitude (3) - 9 freq sornhill (3) - 1 freq shull (3) - 6 freq tohull (3) - 1 freq schull (3) - 1 freq tonyhill (4) - 1 freq shell (4) - 40 freq slichtly (4) - 6 freq ontull (4) - 1 freq sould (4) - 6 freq solemly (4) - 2 freq scuill (4) - 1 freq rosehill (4) - 3 freq sort'll (4) - 1 freq politely (4) - 27 freq skeill (4) - 10 freq schuul (4) - 1 freq schule (4) - 92 freq societal (4) - 4 freq thull (4) - 1 freq sill (4) - 17 freq solids (4) - 1 freq sociable (4) - 7 freq speshully (4) - 1 freq |
solihull (0) - 1 freq shull (4) - 6 freq schull (4) - 1 freq shall (5) - 120 freq schuill (5) - 3 freq sornhill (5) - 1 freq shell (5) - 40 freq tohull (5) - 1 freq shill (5) - 4 freq skull (6) - 45 freq skuill (6) - 10 freq litill (6) - 1 freq sabill (6) - 1 freq slightly (6) - 46 freq southwell (6) - 1 freq auldhill (6) - 26 freq stull (6) - 39 freq schuil (6) - 477 freq squill (6) - 4 freq stixall (6) - 1 freq bowhill (6) - 5 freq shu'll (6) - 2 freq toonhill (6) - 1 freq shuil (6) - 3 freq joshhall (6) - 1 freq |
SoundEx code - S440 slowly - 226 freq schoolhill - 3 freq slawly - 49 freq slawlie - 10 freq sleely - 1 freq slyly - 3 freq sloalie - 1 freq slaalie - 1 freq sleelie - 1 freq solely - 3 freq shale-ile - 1 freq slowlie - 1 freq skellyhill - 2 freq slolee - 1 freq solihull - 1 freq |
MetaPhone code - SLHL solihull - 1 freq |
SOLIHULL |
| Time to execute Levenshtein function - 0.197584 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.412414 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.027737 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.040528 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.003403 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. |