| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| html (0) - 22 freq shtml (1) - 2 freq htm (1) - 17 freq hms (2) - 8 freq he'l (2) - 13 freq 'tll (2) - 1 freq qtme (2) - 1 freq harl (2) - 5 freq hte (2) - 1 freq hthy (2) - 1 freq ht (2) - 8 freq heel (2) - 35 freq homo (2) - 3 freq haul (2) - 47 freq hail (2) - 259 freq hayl (2) - 2 freq hamil (2) - 2 freq hame (2) - 2334 freq hoal (2) - 4 freq him' (2) - 15 freq hmi (2) - 2 freq hol (2) - 11 freq tel (2) - 47 freq tsl (2) - 2 freq it'l (2) - 2 freq |
html (0) - 22 freq shtml (2) - 2 freq htm (2) - 17 freq httle (3) - 1 freq hotmail (3) - 3 freq hotel (3) - 91 freq hamil (3) - 2 freq hull (4) - 30 freq tm (4) - 7 freq 'til (4) - 15 freq hl (4) - 1 freq ftl (4) - 2 freq hall (4) - 180 freq stal (4) - 4 freq ml (4) - 12 freq mtm (4) - 1 freq stil (4) - 5 freq hima (4) - 4 freq hmm (4) - 22 freq him (4) - 8386 freq holl (4) - 5 freq htt (4) - 1 freq tbl (4) - 1 freq xtmy (4) - 1 freq tul (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.260414 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.340739 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.027852 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.037217 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.000843 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. |