| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unhailly (0) - 1 freq unfairly (2) - 3 freq hailly (2) - 8 freq uswally (3) - 1 freq nairly (3) - 1 freq unhappy (3) - 10 freq gunhill (3) - 2 freq shrilly (3) - 1 freq haill (3) - 411 freq uneasily (3) - 4 freq unhalie (3) - 1 freq chilly (3) - 12 freq haily (3) - 27 freq hilly (3) - 6 freq nilly (3) - 1 freq usually (3) - 176 freq bailly (3) - 1 freq uphaly (3) - 1 freq 'shairly (3) - 1 freq shairly (3) - 107 freq neilly (3) - 12 freq uphill (3) - 3 freq railly (3) - 1 freq locailly (3) - 1 freq hally (3) - 1 freq |
unhailly (0) - 1 freq hailly (3) - 8 freq hilly (4) - 6 freq chilly (4) - 12 freq nilly (4) - 1 freq hally (4) - 1 freq unholy (4) - 4 freq unhalie (4) - 1 freq neilly (4) - 12 freq uphill (4) - 3 freq unfairly (4) - 3 freq gunhill (4) - 2 freq haill (4) - 411 freq intill (5) - 125 freq inhaled (5) - 3 freq quhill (5) - 1 freq tinhalla (5) - 1 freq oneill (5) - 2 freq inhalin (5) - 3 freq inhale (5) - 2 freq whall (5) - 1 freq neville (5) - 14 freq unusually (5) - 3 freq intilla (5) - 1 freq dounhill (5) - 1 freq |
SoundEx code - U540 unweel - 2 freq unul - 1 freq unholy - 4 freq unhool - 3 freq unhalie - 1 freq umwhile - 16 freq unhailly - 1 freq |
MetaPhone code - UNHL unholy - 4 freq unhool - 3 freq unhalie - 1 freq unhailly - 1 freq |
UNHAILLY |
| Time to execute Levenshtein function - 0.509113 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.607766 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.034846 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.070230 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.000876 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. |