| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gunhill (0) - 2 freq dounhill (2) - 1 freq gun-ile (2) - 1 freq uphill (2) - 3 freq dunghill (2) - 1 freq muthill (2) - 1 freq quhill (2) - 1 freq munnell (3) - 2 freq cornhill (3) - 5 freq €™neill (3) - 1 freq doonhill (3) - 6 freq gill (3) - 3 freq guild (3) - 11 freq gunnels (3) - 4 freq ontill (3) - 3 freq mundell (3) - 2 freq bunnil (3) - 8 freq jhill (3) - 19 freq gundies (3) - 1 freq fuaill (3) - 1 freq chill (3) - 45 freq unholy (3) - 4 freq until (3) - 477 freq gunnul (3) - 2 freq gull (3) - 7 freq |
gunhill (0) - 2 freq dounhill (3) - 1 freq doonhill (4) - 6 freq unhailly (4) - 1 freq tonyhill (4) - 1 freq toonhill (4) - 1 freq govanhill (4) - 1 freq quhill (4) - 1 freq gun-ile (4) - 1 freq uphill (4) - 3 freq dunghill (4) - 1 freq muthill (4) - 1 freq finhall (4) - 22 freq auldhill (5) - 26 freq gunnel (5) - 2 freq guid'll (5) - 1 freq gushel (5) - 1 freq tinhalla (5) - 1 freq 'hill (5) - 1 freq winmill (5) - 1 freq sornhill (5) - 1 freq candill (5) - 1 freq yun'll (5) - 2 freq shill (5) - 4 freq downhill (5) - 1 freq |
SoundEx code - G540 gunnel - 2 freq gunnul - 2 freq gemmle - 2 freq gunnal - 1 freq gumlie - 4 freq gemmule - 1 freq gemmel - 1 freq gemmely - 1 freq goeen'll - 1 freq gmail - 1 freq gunhill - 2 freq gun-ile - 1 freq genial - 2 freq gqnlu - 1 freq gameÂ’ll - 1 freq |
MetaPhone code - KNHL gunhill - 2 freq |
GUNHILL |
| Time to execute Levenshtein function - 0.302416 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.594670 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.063114 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.040361 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.000863 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. |