| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thesaurus (0) - 6 freq thesaury (2) - 1 freq thesaurer (2) - 5 freq thesaur (2) - 2 freq thesaurar (2) - 1 freq thesauruses (2) - 2 freq theatres (3) - 5 freq theseus (3) - 25 freq thaur's (3) - 7 freq thesaurer's (3) - 1 freq taurus (3) - 5 freq treesures (4) - 1 freq desairs (4) - 1 freq thesis (4) - 3 freq thair's (4) - 110 freq thehaar (4) - 1 freq thaur'd (4) - 1 freq itherairts (4) - 1 freq tresors (4) - 1 freq chesters (4) - 4 freq theatre (4) - 143 freq themsails (4) - 1 freq whauras (4) - 5 freq belarus (4) - 3 freq hearts (4) - 32 freq |
thesaurus (0) - 6 freq thesauruses (3) - 2 freq thesaurar (3) - 1 freq thesaur (3) - 2 freq thesaury (3) - 1 freq thesaurer (3) - 5 freq theseus (4) - 25 freq theatres (4) - 5 freq thurs (5) - 16 freq thesedays (5) - 1 freq tharis (5) - 1 freq thars (5) - 2 freq thers (5) - 1 freq treysures (5) - 4 freq treisures (5) - 1 freq thaires (5) - 2 freq theirs (5) - 44 freq theses (5) - 4 freq thairs (5) - 14 freq treisurs (5) - 7 freq theres (5) - 110 freq treasures (5) - 4 freq thesps (5) - 1 freq tresors (5) - 1 freq taurus (5) - 5 freq |
SoundEx code - T262 teachers - 227 freq tigers - 5 freq tweezers - 3 freq tee-sark - 1 freq teegers - 36 freq teechurs - 3 freq tweeser's - 2 freq teacher's - 24 freq takers - 2 freq tigress - 2 freq teachers' - 5 freq 'teachers - 1 freq taakers - 4 freq tasers - 1 freq tiger's - 1 freq taichers - 2 freq tagger's - 1 freq tossers - 7 freq thesaurus - 6 freq teeger's - 10 freq teegars - 1 freq teigers - 2 freq teegars' - 1 freq thiggers - 1 freq teichars - 1 freq techers - 1 freq twa-cairiage - 1 freq thesauruses - 2 freq thick-craigit - 1 freq t-serks - 1 freq tkqrk - 1 freq thecircle - 1 freq thegreygoose - 3 freq tigrez - 1 freq tjrezacb - 1 freq teachers- - 1 freq |
MetaPhone code - 0SRS thesaurus - 6 freq |
THESAURUS |
| Time to execute Levenshtein function - 0.223891 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.409170 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.027389 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.037866 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.000962 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. |