| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| shtml (0) - 2 freq html (1) - 22 freq shame (2) - 177 freq htm (2) - 17 freq shall (2) - 123 freq sheol (2) - 1 freq shaal (2) - 6 freq shum (2) - 1 freq shawl (2) - 26 freq shell (2) - 39 freq stil (2) - 5 freq sheel (2) - 3 freq shiel (2) - 2 freq shim (2) - 1 freq sattl (2) - 1 freq shti (2) - 2 freq shuil (2) - 3 freq stll (2) - 2 freq shool (2) - 1 freq shoul (2) - 2 freq shoal (2) - 2 freq shil (2) - 1 freq shal (2) - 26 freq settl (2) - 1 freq shill (2) - 4 freq |
shtml (0) - 2 freq html (2) - 22 freq shem (4) - 3 freq shill (4) - 4 freq sheil (4) - 15 freq settl (4) - 1 freq shil (4) - 1 freq shoal (4) - 2 freq sham (4) - 8 freq shal (4) - 26 freq shull (4) - 6 freq shuttle (4) - 12 freq shimley (4) - 1 freq shemale (4) - 1 freq shottle (4) - 1 freq shammle (4) - 1 freq shoul (4) - 2 freq stal (4) - 4 freq shael (4) - 8 freq shaul (4) - 1 freq shaal (4) - 6 freq shum (4) - 1 freq shawl (4) - 26 freq shool (4) - 1 freq shall (4) - 123 freq |
SoundEx code - S354 suddenly - 259 freq suddenlie - 4 freq siddenly - 17 freq settenly - 1 freq stane-lined - 1 freq stanley - 34 freq stanley's - 2 freq stimulate - 3 freq steemulation - 2 freq stimulatin - 2 freq stummle - 3 freq stem-mull - 1 freq stummelt - 2 freq stummles - 1 freq stummled - 2 freq 'suddenly - 1 freq stane-auld - 1 freq steimulatit - 1 freq steimulatin - 1 freq scathinly - 1 freq stanle - 1 freq steenhillock - 53 freq steenhillock's - 10 freq shtml - 2 freq stummlin - 1 freq stainless - 3 freq staenloopen - 1 freq sudden-like - 1 freq stummlet - 1 freq stumult - 1 freq suddenlik - 1 freq skuttamilla-skroo - 1 freq stainless-steel - 1 freq stenalineukie - 1 freq scottmalt - 3 freq |
MetaPhone code - XTML shtml - 2 freq |
SHTML |
| Time to execute Levenshtein function - 0.396830 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.598719 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.027966 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.042800 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.023143 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. |