| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| t-serks (0) - 1 freq serks (2) - 1 freq tasers (2) - 1 freq jerks (3) - 2 freq sherks (3) - 2 freq terms (3) - 133 freq asserts (3) - 1 freq miser's (3) - 1 freq uisers (3) - 17 freq serbs (3) - 2 freq taers (3) - 19 freq surks (3) - 1 freq perks (3) - 9 freq berserks (3) - 1 freq ters (3) - 1 freq serss (3) - 1 freq insecks (3) - 1 freq taeks (3) - 1 freq timers (3) - 5 freq seiks (3) - 1 freq posers (3) - 5 freq tooers (3) - 6 freq beseiks (3) - 1 freq desers (3) - 1 freq takers (3) - 2 freq |
t-serks (0) - 1 freq serks (4) - 1 freq tasers (4) - 1 freq t-shirts (5) - 11 freq tusks (5) - 7 freq tasks (5) - 13 freq tossers (5) - 7 freq srks (5) - 1 freq turks (5) - 4 freq berserks (5) - 1 freq sarks (5) - 17 freq tee-sark (5) - 1 freq surks (5) - 1 freq losers (6) - 3 freq miser's (6) - 1 freq terk (6) - 1 freq tweaks (6) - 1 freq touers (6) - 4 freq serrs (6) - 5 freq teer's (6) - 1 freq seeks (6) - 24 freq asserts (6) - 1 freq lasers (6) - 2 freq teers (6) - 4 freq misers (6) - 1 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 - TSRKS t-serks - 1 freq |
T-SERKS |
| Time to execute Levenshtein function - 0.254680 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.388881 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.031131 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.038903 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.000907 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. |