| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| smellerman (0) - 10 freq kellerman (2) - 3 freq smellerman's (2) - 5 freq swelteran (3) - 1 freq skelterin (4) - 5 freq letterman (4) - 1 freq spellers (4) - 1 freq spelderin (4) - 1 freq steersman (4) - 2 freq gaelderan (4) - 1 freq spellan (4) - 1 freq soleman (4) - 2 freq spelleen (4) - 5 freq sehberian (4) - 1 freq sweeman (4) - 3 freq smellin (4) - 14 freq kellerman's (4) - 2 freq yella-man (4) - 1 freq sereaman (4) - 1 freq sneeran (4) - 1 freq stecheran (4) - 1 freq seller (4) - 11 freq spearman (4) - 1 freq smelle (4) - 1 freq smithermann (4) - 1 freq |
smellerman (0) - 10 freq kellerman (4) - 3 freq smellerman's (4) - 5 freq smellin (6) - 14 freq smaller (6) - 13 freq sillerin (6) - 4 freq swelteran (6) - 1 freq shelterin (7) - 1 freq sellers' (7) - 1 freq salesman (7) - 16 freq smithermann (7) - 1 freq sellers (7) - 2 freq swelterin (7) - 3 freq trawlerman (7) - 1 freq speller (7) - 2 freq smauldrin (7) - 1 freq smaulderin (7) - 1 freq sellan (7) - 1 freq seller's (7) - 1 freq smelled (7) - 11 freq smelle (7) - 1 freq sherman (7) - 1 freq superman (7) - 6 freq soleman (7) - 2 freq spelleen (7) - 5 freq |
SoundEx code - S546 smiler - 1 freq similar - 59 freq similarity - 2 freq smaller - 13 freq seemilar - 17 freq smellerman - 10 freq smellerman's - 5 freq seimilar - 7 freq seimilarlie - 1 freq snellryfe - 1 freq seemlar - 9 freq seemilarity - 2 freq similarities - 8 freq seimilarities - 1 freq seemilarly - 1 freq seemilarities - 1 freq similar-like - 1 freq seemilaritie - 1 freq smoliar - 1 freq simmilar - 1 freq similarly - 2 freq sammillar - 1 freq sunallergy - 1 freq |
MetaPhone code - SMLRMN smellerman - 10 freq |
SMELLERMAN |
| Time to execute Levenshtein function - 0.224820 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.376937 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.035591 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.039566 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.001097 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. |