| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thesaurus (0) - 6 freq thesaury (2) - 1 freq thesaurer (2) - 5 freq thesauruses (2) - 2 freq thesaur (2) - 2 freq thesaurar (2) - 1 freq thesaurer's (3) - 1 freq theatres (3) - 5 freq thaur's (3) - 7 freq taurus (3) - 5 freq theseus (3) - 25 freq shears (4) - 11 freq hears (4) - 46 freq taewarts (4) - 1 freq thars (4) - 2 freq themarra (4) - 1 freq 'hearts (4) - 1 freq teegars (4) - 1 freq deenosaurus (4) - 1 freq meesures (4) - 1 freq thar's (4) - 2 freq textures (4) - 2 freq itherairts (4) - 1 freq therapies (4) - 2 freq hearts (4) - 32 freq |
thesaurus (0) - 6 freq thesaurar (3) - 1 freq thesaur (3) - 2 freq thesauruses (3) - 2 freq thesaury (3) - 1 freq thesaurer (3) - 5 freq theseus (4) - 25 freq theatres (4) - 5 freq thesedays (5) - 1 freq theses (5) - 4 freq treesures (5) - 1 freq thurs (5) - 16 freq tresors (5) - 1 freq theres (5) - 108 freq tharis (5) - 1 freq thesps (5) - 1 freq treisures (5) - 1 freq thaires (5) - 2 freq treisurs (5) - 7 freq thers (5) - 1 freq thesis (5) - 3 freq treysures (5) - 4 freq treasures (5) - 4 freq theirs (5) - 44 freq thairs (5) - 14 freq |
SoundEx code - T262 teachers - 213 freq tigers - 5 freq tweezers - 3 freq tee-sark - 1 freq teegers - 36 freq teechurs - 3 freq tweeser's - 2 freq takers - 2 freq teacher's - 19 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.198688 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.411267 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.028020 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.040982 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.000791 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. |