| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tytvb (0) - 1 freq tjtvt (2) - 1 freq dyjvb (2) - 1 freq yvb (2) - 1 freq totve (2) - 1 freq tyvm (2) - 1 freq zypvb (2) - 1 freq ytb (2) - 1 freq ytgt (3) - 1 freq btv (3) - 1 freq typos (3) - 2 freq kyth (3) - 3 freq totty (3) - 12 freq dytes (3) - 1 freq fyth (3) - 1 freq tyfbl (3) - 1 freq tv' (3) - 1 freq otsb (3) - 1 freq toty (3) - 42 freq tut (3) - 67 freq trove (3) - 3 freq styte (3) - 4 freq tits (3) - 33 freq tyeuk (3) - 21 freq typo (3) - 3 freq |
tytvb (0) - 1 freq totve (3) - 1 freq tyvm (4) - 1 freq ytb (4) - 1 freq zypvb (4) - 1 freq tjtvt (4) - 1 freq yvb (4) - 1 freq dyjvb (4) - 1 freq ytt (5) - 1 freq ltrb (5) - 1 freq tat' (5) - 1 freq totie (5) - 18 freq tsb (5) - 1 freq ktb (5) - 1 freq tot (5) - 4 freq tab (5) - 7 freq titus (5) - 1 freq tyauv (5) - 1 freq toto (5) - 6 freq totue (5) - 1 freq tutu (5) - 3 freq atv (5) - 1 freq tt (5) - 36 freq stab (5) - 12 freq tb (5) - 14 freq |
SoundEx code - T310 that-hiv - 1 freq that've - 9 freq tattie-bye - 1 freq tattibye - 1 freq totve - 1 freq that'v - 1 freq thtpoa - 1 freq teddyb - 1 freq tytvb - 1 freq |
MetaPhone code - TTFB tytvb - 1 freq |
TYTVB |
| Time to execute Levenshtein function - 0.195801 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.347868 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.028473 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.046195 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.001283 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. |