| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thumpeth (0) - 1 freq trumpet (2) - 25 freq thumped (2) - 5 freq thumpit (2) - 2 freq thumpen (2) - 1 freq thumper (2) - 1 freq trumpets (2) - 4 freq humpty (3) - 7 freq thumps (3) - 5 freq thumbit (3) - 1 freq thumsel' (3) - 1 freq crumpets (3) - 1 freq thumsel (3) - 1 freq trumped (3) - 2 freq trumpet's (3) - 1 freq jumpet (3) - 1 freq toucheth (3) - 1 freq thump (3) - 33 freq thumpin (3) - 19 freq thumping (3) - 2 freq trumpat (3) - 1 freq humped (3) - 2 freq thumsels (3) - 7 freq crumpet (3) - 1 freq humph (3) - 15 freq |
thumpeth (0) - 1 freq thumpit (3) - 2 freq trumpets (4) - 4 freq thumpen (4) - 1 freq thumper (4) - 1 freq thumped (4) - 5 freq trumpet (4) - 25 freq trumpat (5) - 1 freq trumpit (5) - 5 freq thump (5) - 33 freq thumpin (5) - 19 freq humpit (5) - 1 freq thumbit (5) - 1 freq thumps (5) - 5 freq humpty (5) - 7 freq thumping (5) - 2 freq thump's (5) - 1 freq humph (5) - 15 freq thompson (6) - 5 freq champit (6) - 11 freq humphy (6) - 52 freq trampt (6) - 2 freq trampit (6) - 6 freq tempit (6) - 11 freq triumph (6) - 17 freq |
SoundEx code - T513 temptation - 22 freq tempt - 9 freq then-bit - 1 freq tempted - 23 freq thumped - 5 freq tounfuit - 2 freq temptit - 11 freq temptt - 1 freq temptin - 11 freq thumbit - 1 freq ten-foot - 2 freq tempit - 11 freq temptet - 1 freq tempter - 1 freq thumpeth - 1 freq timptations - 1 freq timptation's - 1 freq timptation - 1 freq temptan - 2 freq temptations - 2 freq tempts - 2 freq temptautioun - 1 freq thumpit - 2 freq ten-fit - 1 freq temptised - 1 freq tinpot - 3 freq tamped - 1 freq ten-foot-pole - 1 freq tempting - 3 freq temptress - 1 freq tenfeettallabdn - 1 freq |
MetaPhone code - 0MP0 thumpeth - 1 freq |
THUMPETH |
| Time to execute Levenshtein function - 0.259575 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.557051 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.031867 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.064237 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.000910 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. |