| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tweezers (0) - 3 freq tweeters (1) - 1 freq breezers (2) - 1 freq teegers (2) - 36 freq tenzers (2) - 1 freq freezers (2) - 1 freq tweeter (2) - 2 freq tweeser's (2) - 2 freq sweemers (2) - 1 freq speeders (3) - 7 freq feeders (3) - 1 freq steeers (3) - 1 freq freezes (3) - 4 freq sweetens (3) - 1 freq bleeters (3) - 1 freq deeners (3) - 1 freq feelers (3) - 1 freq sleepers (3) - 4 freq tweeds (3) - 3 freq breezes (3) - 2 freq neepers (3) - 5 freq sneezes (3) - 15 freq theeker (3) - 1 freq bleezer (3) - 1 freq seekers (3) - 9 freq |
tweezers (0) - 3 freq tweeters (2) - 1 freq tenzers (3) - 1 freq sweemers (4) - 1 freq tweeter (4) - 2 freq wowzers (4) - 1 freq tweeser's (4) - 2 freq breezers (4) - 1 freq teegers (4) - 36 freq freezers (4) - 1 freq tellers (5) - 5 freq aweers (5) - 1 freq twitters (5) - 3 freq tedders (5) - 1 freq twelves (5) - 1 freq weers (5) - 16 freq teylers (5) - 1 freq twenes (5) - 29 freq sweers (5) - 1 freq tweets (5) - 56 freq teers (5) - 4 freq tweests (5) - 1 freq twa'oors (5) - 1 freq towers (5) - 19 freq twaloors (5) - 2 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 - TWSRS tweezers - 3 freq tweeser's - 2 freq |
TWEEZERS |
| Time to execute Levenshtein function - 0.231629 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.374737 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.028354 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.038155 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.000931 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. |