| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sornhill (0) - 1 freq cornhill (1) - 5 freq downhill (2) - 1 freq doonhill (2) - 6 freq toonhill (2) - 1 freq barnhill (2) - 1 freq dounhill (2) - 1 freq thornhill (2) - 4 freq cornell (3) - 1 freq shill (3) - 4 freq orgill (3) - 1 freq domnhall (3) - 1 freq solihull (3) - 1 freq downhall (3) - 2 freq bowhill (3) - 5 freq torvill (3) - 1 freq govanhill (3) - 1 freq o'neill (3) - 5 freq hardhill (3) - 2 freq gornall (3) - 1 freq tonyhill (3) - 1 freq soshil (3) - 1 freq shrill (3) - 20 freq cornwall (3) - 9 freq cranhill (3) - 3 freq |
sornhill (0) - 1 freq cornhill (2) - 5 freq barnhill (3) - 1 freq doonhill (4) - 6 freq cranhill (4) - 3 freq dounhill (4) - 1 freq thornhill (4) - 4 freq downhill (4) - 1 freq toonhill (4) - 1 freq gunhill (5) - 2 freq tonyhill (5) - 1 freq gornall (5) - 1 freq stobhill (5) - 1 freq hardhill (5) - 2 freq jordanhill (5) - 4 freq sort'll (5) - 1 freq cornwall (5) - 9 freq downhall (5) - 2 freq domnhall (5) - 1 freq shill (5) - 4 freq cornell (5) - 1 freq solihull (5) - 1 freq maryhill (5) - 3 freq coarnmill (5) - 2 freq rosehill (5) - 3 freq |
SoundEx code - S654 scrammled - 6 freq scrammlin - 2 freq scrummlin - 1 freq sornhill - 1 freq scrammelt - 2 freq scrammult - 1 freq scramml't - 1 freq serenely - 6 freq scrammlie - 1 freq shoormal - 9 freq 'shroomal' - 1 freq scrammlers - 1 freq shoormail - 1 freq shörmal - 4 freq scrammle - 2 freq sharnie-loss - 8 freq scrammlit - 1 freq sharon'll - 1 freq srummlie - 1 freq |
MetaPhone code - SRNHL sornhill - 1 freq |
SORNHILL |
| Time to execute Levenshtein function - 0.194789 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.372873 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.027461 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.036846 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.000918 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. |