| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| teacup (0) - 13 freq teacups (1) - 9 freq teache (2) - 1 freq tae-cup (2) - 3 freq taycup (2) - 4 freq teachur (2) - 2 freq teach (2) - 84 freq excep (3) - 14 freq toap (3) - 37 freq tarp (3) - 1 freq reacts (3) - 1 freq teases (3) - 6 freq acum (3) - 1 freq taur (3) - 9 freq techt (3) - 2 freq trap (3) - 60 freq teath (3) - 1 freq aup (3) - 1 freq team's (3) - 4 freq teased (3) - 5 freq traced (3) - 14 freq reach (3) - 143 freq temp (3) - 734 freq tea-no (3) - 1 freq endup (3) - 1 freq |
teacup (0) - 13 freq teacups (2) - 9 freq taycup (2) - 4 freq tcp (3) - 5 freq teach (3) - 84 freq teache (3) - 1 freq tae-cup (3) - 3 freq teachee (4) - 3 freq taecups (4) - 1 freq taco (4) - 1 freq tap (4) - 757 freq tacn (4) - 2 freq tacit (4) - 1 freq tdup (4) - 1 freq scaup (4) - 5 freq teacake (4) - 1 freq tie-up (4) - 1 freq recoup (4) - 3 freq tachy (4) - 1 freq tlup (4) - 1 freq tac' (4) - 1 freq caup (4) - 11 freq terp (4) - 2 freq teck (4) - 1 freq tup (4) - 6 freq |
SoundEx code - T210 teacup - 13 freq tasefu' - 1 freq thouchfu - 1 freq tsb - 1 freq t-shape - 1 freq taycup - 4 freq tassiefu - 3 freq tae-cup - 3 freq tcyaave - 1 freq toyshop - 1 freq tcyauve - 3 freq tcp - 5 freq thijob - 1 freq tqyf - 1 freq tkuyb - 1 freq tkvvi - 1 freq ttkf - 1 freq twgouyb - 1 freq txph - 1 freq |
MetaPhone code - TKP teacup - 13 freq taycup - 4 freq dug-up - 1 freq tae-cup - 3 freq dookie-up - 1 freq tcp - 5 freq dogpoo - 1 freq dyqpo - 1 freq |
TEACUP cup - 308 freq cups - 50 freq teacup - 13 freq teacups - 9 freq cuppa - 21 freq taycup - 4 freq tea - 560 freq teacup - 13 freq taycup - 4 freq tay - 185 freq teas - 3 freq teacups - 9 freq |
| Time to execute Levenshtein function - 0.249339 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.356808 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.026969 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.037789 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.000872 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. |