| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thump (0) - 33 freq whump (1) - 2 freq thum (1) - 463 freq thumb (1) - 25 freq trump (1) - 74 freq tump (1) - 1 freq hump (1) - 15 freq thums (1) - 1 freq thum- (1) - 1 freq thomp (1) - 1 freq thumps (1) - 5 freq thuma (1) - 1 freq them- (2) - 2 freq thramp (2) - 2 freq them' (2) - 5 freq clump (2) - 18 freq tfdmp (2) - 1 freq hums (2) - 3 freq slump (2) - 6 freq thaum (2) - 1 freq theme (2) - 39 freq thim (2) - 193 freq thrap (2) - 2 freq thule (2) - 5 freq stump (2) - 19 freq |
thump (0) - 33 freq thomp (1) - 1 freq thums (2) - 1 freq thum- (2) - 1 freq thuma (2) - 1 freq hump (2) - 15 freq thumps (2) - 5 freq tump (2) - 1 freq whump (2) - 2 freq thum (2) - 463 freq thumb (2) - 25 freq trump (2) - 74 freq tham (3) - 43 freq thumpin (3) - 19 freq thyme (3) - 4 freq thame (3) - 27 freq chomp (3) - 3 freq thoum (3) - 13 freq thim- (3) - 2 freq hmp (3) - 1 freq thumped (3) - 5 freq tramp (3) - 27 freq thumper (3) - 1 freq thrup (3) - 1 freq thumpen (3) - 1 freq |
SoundEx code - T510 thump - 33 freq thumb - 25 freq tomb - 31 freq tomboy - 1 freq tump - 1 freq tempo - 4 freq temp - 734 freq twa-an-a-hauf - 2 freq thomp - 1 freq thoomb - 6 freq tumb - 1 freq timpo - 1 freq temp- - 7 freq tmv - 1 freq tnv - 1 freq tomb - 1 freq tmmf - 1 freq timehop - 1 freq tenv - 1 freq tywanb - 1 freq tonyip - 1 freq |
MetaPhone code - 0MP thump - 33 freq thomp - 1 freq |
THUMP |
| Time to execute Levenshtein function - 0.390723 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.570712 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.027507 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.073733 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.000893 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. |