Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
theesel (0) - 6 freq themsel (1) - 8 freq thersel (1) - 1 freq theesels (1) - 1 freq cheesel (1) - 1 freq theesael (1) - 1 freq hessel (2) - 9 freq theses (2) - 4 freq thysel (2) - 1 freq thersels (2) - 2 freq thumsel (2) - 1 freq thirsel (2) - 5 freq theirsel (2) - 5 freq eesel (2) - 1 freq thee'll (2) - 1 freq deesel (2) - 8 freq t'ersel (2) - 7 freq themsels (2) - 152 freq reesel (2) - 4 freq meesel (2) - 2 freq cheese (2) - 138 freq cheeses (2) - 1 freq theeker (2) - 1 freq hetsel (2) - 1 freq heezsel (2) - 1 freq |
theesel (0) - 6 freq theesael (1) - 1 freq thysel (2) - 1 freq thersel (2) - 1 freq themsel (2) - 8 freq theesels (2) - 1 freq cheesel (2) - 1 freq thees (3) - 4 freq theimsel (3) - 1 freq these (3) - 1110 freq cheisel (3) - 2 freq these' (3) - 1 freq thirsel (3) - 5 freq thumsel (3) - 1 freq theirsel (3) - 5 freq theses (3) - 4 freq tensely (4) - 2 freq theyll (4) - 5 freq tossel (4) - 1 freq thairsel (4) - 2 freq thysell (4) - 1 freq hisel (4) - 18 freq thell (4) - 4 freq they'il (4) - 2 freq thaimsel (4) - 1 freq |
SoundEx code - T240 this'll - 10 freq teckle - 5 freq 'this'll - 1 freq taigle - 10 freq tickle - 12 freq tackle - 30 freq tassel - 2 freq theesel - 6 freq ïtsel - 4 freq thïs'll - 2 freq thickly - 1 freq 'these'll - 1 freq tkull - 1 freq theesael - 1 freq tequila - 1 freq tekkil - 3 freq t'sæl - 1 freq th'eeswal - 2 freq tossel - 1 freq tiscali - 1 freq thysell - 1 freq taigil - 2 freq tuckwell - 1 freq touzly - 1 freq touzle - 1 freq tissil - 1 freq thysel - 1 freq tesla - 2 freq tooslie - 1 freq tsl - 2 freq tslaw - 1 freq taikle - 1 freq thicklie - 1 freq tql - 1 freq toozle - 1 freq toggle - 1 freq tchell - 1 freq |
MetaPhone code - 0SL this'll - 10 freq 'this'll - 1 freq theesel - 6 freq thïs'll - 2 freq 'these'll - 1 freq theesael - 1 freq thysell - 1 freq thysel - 1 freq |
THEESEL |
Time to execute Levenshtein function - 0.364246 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.533535 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.062678 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.036483 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.000889 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. |