| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| html (0) - 22 freq htm (1) - 17 freq shtml (1) - 2 freq hkrl (2) - 1 freq hams (2) - 10 freq atil (2) - 17 freq hmt (2) - 1 freq him' (2) - 15 freq hurl (2) - 64 freq xtl (2) - 1 freq hymn (2) - 17 freq hmv (2) - 2 freq hime (2) - 17 freq stil (2) - 5 freq hym (2) - 5 freq qtme (2) - 1 freq enml (2) - 1 freq hamil (2) - 2 freq hell (2) - 375 freq hol (2) - 11 freq hawl (2) - 1 freq heal (2) - 27 freq tll (2) - 11 freq tal (2) - 6 freq hmm (2) - 22 freq |
html (0) - 22 freq shtml (2) - 2 freq htm (2) - 17 freq hotmail (3) - 3 freq httle (3) - 1 freq hamil (3) - 2 freq hotel (3) - 99 freq haal (4) - 42 freq hts (4) - 5 freq haul (4) - 48 freq dtll (4) - 1 freq hyme (4) - 6 freq tmc (4) - 1 freq home (4) - 280 freq hte (4) - 1 freq hmi (4) - 2 freq homs (4) - 1 freq ftl (4) - 2 freq ttme (4) - 1 freq otel (4) - 1 freq tl (4) - 9 freq ham (4) - 49 freq hms (4) - 8 freq hemp (4) - 3 freq 'tl (4) - 1 freq |
SoundEx code - H354 html - 22 freq hotmail - 3 freq |
MetaPhone code - TML tumble - 9 freq tummle - 19 freq timely - 4 freq demmle - 2 freq tummel - 5 freq tummile - 1 freq dam'll - 1 freq html - 22 freq timmle - 4 freq time'll - 3 freq demmel - 1 freq tombola - 2 freq dumela - 1 freq team'll - 1 freq dimly - 3 freq tamil - 1 freq €˜timely - 1 freq tommy'll - 1 freq €˜tumble - 1 freq tam'll - 1 freq tommyle - 1 freq tommel - 1 freq |
HTML |
| Time to execute Levenshtein function - 0.184238 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.354612 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.027324 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.037275 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.000948 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. |