| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kerryfail (0) - 1 freq kerryoan (3) - 1 freq kerry-in (3) - 1 freq kerryin (3) - 12 freq kerryan (3) - 1 freq kerrycann (3) - 1 freq ferryin (4) - 2 freq seryfa (4) - 2 freq terrific (4) - 2 freq kerriein (4) - 1 freq derail (4) - 1 freq berryhill (4) - 6 freq kerryeen (4) - 1 freq terrain (4) - 10 freq meyfair (4) - 1 freq forkytail (4) - 2 freq yersail (4) - 1 freq merryin (4) - 3 freq ferryhill (4) - 2 freq herryin (4) - 2 freq kerry (4) - 47 freq kerry-on (4) - 2 freq jerriais (4) - 1 freq kennyfarq (4) - 14 freq kerfl (4) - 1 freq |
kerryfail (0) - 1 freq kerryan (5) - 1 freq kerryin (5) - 12 freq kerfl (5) - 1 freq kerry-in (5) - 1 freq kerryoan (5) - 1 freq kerryon (6) - 1 freq kerry-oot (6) - 1 freq kyerryin (6) - 1 freq ferfil (6) - 7 freq kerrit (6) - 1 freq ferfal (6) - 8 freq terrifyin (6) - 13 freq kerrying (6) - 2 freq kerrjin (6) - 2 freq kerrant (6) - 1 freq kerrie (6) - 1 freq kerry (6) - 47 freq merrital (6) - 1 freq kerry-on (6) - 2 freq kerriein (6) - 1 freq kerryeen (6) - 1 freq barraful (6) - 1 freq terrific (6) - 2 freq kerrycann (6) - 1 freq |
SoundEx code - K614 kerfuully - 1 freq kerfl - 1 freq kerryfail - 1 freq |
MetaPhone code - KRFL carefully - 40 freq gravely - 12 freq careful - 43 freq grevel - 4 freq gravel - 9 freq criffel - 5 freq grovel - 3 freq grevvel - 1 freq grief'll - 1 freq gruffalo - 76 freq gruffal - 2 freq gravelly - 3 freq cairfully - 4 freq carefil - 1 freq gruffly - 2 freq graivel - 5 freq 'careful - 1 freq grove'll - 1 freq kerfuully - 1 freq carefuul - 1 freq kerfl - 1 freq cairavel - 1 freq craighall - 1 freq grevelly - 1 freq carefullie - 1 freq gruffalo' - 2 freq kerryfail - 1 freq |
KERRYFAIL |
| Time to execute Levenshtein function - 0.326639 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.551854 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.041999 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.045782 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.000975 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. |