| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| javell (0) - 1 freq lavell (1) - 2 freq navels (2) - 1 freq fatell (2) - 1 freq navel (2) - 1 freq jell (2) - 3 freq janela (2) - 5 freq ravelt (2) - 1 freq revell (2) - 1 freq gavel (2) - 6 freq javelin (2) - 1 freq lovell (2) - 1 freq abell (2) - 1 freq waell (2) - 1 freq zabell (2) - 1 freq ravel (2) - 2 freq pavel (2) - 1 freq masell (2) - 67 freq dayell (2) - 1 freq save's (3) - 1 freq saall (3) - 1 freq james (3) - 283 freq knell (3) - 5 freq gravely (3) - 12 freq havent (3) - 3 freq |
javell (0) - 1 freq lavell (2) - 2 freq revell (3) - 1 freq jell (3) - 3 freq lovell (3) - 1 freq javelin (3) - 1 freq eivill (4) - 1 freq jill (4) - 14 freq jovial (4) - 1 freq jekyll (4) - 14 freq j'll (4) - 3 freq evill (4) - 1 freq voll (4) - 1 freq jll (4) - 1 freq vaill (4) - 7 freq novella (4) - 4 freq novelle (4) - 4 freq jelly (4) - 14 freq saville (4) - 5 freq jhill (4) - 19 freq jeelly (4) - 1 freq vll (4) - 1 freq pavel (4) - 1 freq ravelt (4) - 1 freq ravel (4) - 2 freq |
SoundEx code - J140 jabblie - 1 freq jibble - 4 freq joyfully - 1 freq jubilee - 4 freq jabble - 2 freq joyful - 2 freq javell - 1 freq jpl - 2 freq €˜joyfull - 1 freq jovial - 1 freq jpla - 1 freq |
MetaPhone code - JFL joyfully - 1 freq joyful - 2 freq javell - 1 freq €˜joyfull - 1 freq jovial - 1 freq |
JAVELL |
| Time to execute Levenshtein function - 0.371324 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.820179 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.035764 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.059577 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.001213 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. |