| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hovels (0) - 1 freq hovers (1) - 3 freq shovels (1) - 10 freq hotels (1) - 9 freq novels (1) - 29 freq hovel (1) - 4 freq hovel's (1) - 1 freq tooels (2) - 3 freq rovers (2) - 23 freq doves (2) - 2 freq hoved (2) - 4 freq navels (2) - 1 freq howe's (2) - 1 freq jowels (2) - 3 freq howells (2) - 1 freq hools (2) - 2 freq roves (2) - 1 freq towels (2) - 5 freq bevels (2) - 1 freq hostels (2) - 1 freq hopes (2) - 39 freq hooves (2) - 21 freq homely (2) - 2 freq hotel (2) - 99 freq hover (2) - 9 freq |
hovels (0) - 1 freq hovel (2) - 4 freq hovers (2) - 3 freq novels (2) - 29 freq hovel's (2) - 1 freq shovels (2) - 10 freq hotels (2) - 9 freq havens (3) - 1 freq hazels (3) - 2 freq hooves (3) - 21 freq kevels (3) - 1 freq howls (3) - 15 freq vouels (3) - 1 freq heels (3) - 77 freq vooels (3) - 2 freq hives (3) - 2 freq haels (3) - 1 freq holes (3) - 73 freq hools (3) - 2 freq levels (3) - 66 freq hols (3) - 6 freq navels (3) - 1 freq bevels (3) - 1 freq novils (3) - 1 freq havers (3) - 35 freq |
SoundEx code - H142 howplessly - 2 freq hopeless - 12 freq hauf-licht - 6 freq hauflicht - 1 freq haiveless - 1 freq hobbles - 2 freq howplessness - 2 freq hovels - 1 freq hauf-likit - 1 freq hapless - 11 freq hopelessness - 2 freq hauf-lachin - 1 freq howpless - 5 freq hopless - 1 freq hubbleskyu - 2 freq hovel's - 1 freq hoppless - 1 freq haveless - 1 freq hafolk - 1 freq hubbelskyu - 1 freq hubbilshue - 1 freq hopelessly - 1 freq €˜hopelessly - 1 freq hauf-light - 2 freq hauf-lauchin - 1 freq hplayspiano - 1 freq |
MetaPhone code - HFLS haiveless - 1 freq hovels - 1 freq hovel's - 1 freq highheels - 1 freq haveless - 1 freq |
HOVELS |
| Time to execute Levenshtein function - 0.225456 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.404879 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.028274 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.044406 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.000894 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. |