| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thesps (0) - 1 freq thesis (1) - 3 freq theses (1) - 4 freq hesps (1) - 2 freq thengs (2) - 1 freq theats (2) - 2 freq esps (2) - 2 freq them's (2) - 6 freq hesp (2) - 1 freq heeps (2) - 1 freq taests (2) - 1 freq thers (2) - 1 freq cheeps (2) - 2 freq thems (2) - 1 freq tess (2) - 1 freq sheeps (2) - 5 freq phelps (2) - 23 freq theres (2) - 110 freq themes (2) - 22 freq thes (2) - 12 freq threaps (2) - 56 freq chests (2) - 7 freq thenks (2) - 42 freq temps (2) - 1 freq chess (2) - 4 freq |
thesps (0) - 1 freq theses (2) - 4 freq hesps (2) - 2 freq thesis (2) - 3 freq whisps (3) - 1 freq theseus (3) - 25 freq threips (3) - 10 freq threaps (3) - 56 freq thumps (3) - 5 freq theats (4) - 2 freq thens (4) - 2 freq whess (4) - 3 freq ther's (4) - 9 freq hess (4) - 2 freq theens (4) - 1 freq these' (4) - 1 freq theirs (4) - 44 freq tress (4) - 4 freq esps (4) - 2 freq sheps (4) - 1 freq wesps (4) - 1 freq thespian (4) - 1 freq this-is (4) - 1 freq theesels (4) - 1 freq thisees (4) - 1 freq |
SoundEx code - T212 teacups - 9 freq tacky-back - 1 freq taycups - 2 freq taecups - 1 freq tae-cups - 1 freq thickbiggeen - 1 freq take-offs - 1 freq tuk-bak - 1 freq tcqpxgh - 1 freq txfhjjhir - 1 freq tjvjzkb - 1 freq thecovecrooner - 1 freq tgbkipcstv - 1 freq thecpeacock - 1 freq thesps - 1 freq tojvkat - 1 freq |
MetaPhone code - 0SPS thesps - 1 freq |
THESPS |
| Time to execute Levenshtein function - 0.233809 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.460271 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.030107 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.040282 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.001020 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. |