| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tyvm (0) - 1 freq tym (1) - 2 freq trvm (1) - 1 freq ydm (2) - 1 freq yvh (2) - 1 freq nyum (2) - 2 freq zyvxm (2) - 1 freq ty (2) - 7 freq ryzm (2) - 1 freq teem (2) - 47 freq y'm (2) - 1 freq yim (2) - 1 freq tsgm (2) - 1 freq tyna (2) - 1 freq ctyem (2) - 1 freq ypm (2) - 2 freq trym (2) - 1 freq tyso (2) - 1 freq trim (2) - 16 freq t've (2) - 5 freq ti'm (2) - 1 freq tyls (2) - 1 freq yvb (2) - 1 freq tove (2) - 3 freq tfrm (2) - 1 freq |
tyvm (0) - 1 freq trvm (2) - 1 freq tym (2) - 2 freq nvm (3) - 1 freq tvs (3) - 2 freq tvl (3) - 1 freq tevc (3) - 1 freq tram (3) - 23 freq term (3) - 99 freq tv (3) - 208 freq tyme (3) - 220 freq thum (3) - 463 freq vm (3) - 11 freq teum (3) - 8 freq t'm (3) - 3 freq taim (3) - 1 freq tvh (3) - 1 freq thavm (3) - 4 freq tuim (3) - 103 freq tham (3) - 43 freq them (3) - 5422 freq thim (3) - 193 freq tiym (3) - 6 freq toam (3) - 1 freq tum (3) - 17 freq |
SoundEx code - T150 thievin - 16 freq tippm - 1 freq tovin - 8 freq tappin - 22 freq theivin - 3 freq two-penny - 1 freq tubin - 1 freq thavm - 4 freq tippin - 4 freq tyauvin - 19 freq typin - 14 freq tyavin - 2 freq teapin - 1 freq typin' - 1 freq toppen - 1 freq toppin - 5 freq twa-pun - 1 freq tappan - 3 freq t'fin - 1 freq theevin - 1 freq tyaavin - 2 freq tuppeny - 1 freq tiefen - 2 freq tippenny - 4 freq theophanie - 1 freq tippeen - 1 freq tyavvin - 1 freq taviani - 2 freq tapin' - 1 freq teyauvin - 1 freq twapenny - 1 freq tiefin - 3 freq tappin' - 2 freq tap-en - 1 freq tvnn - 1 freq tfmmuh - 1 freq tyvm - 1 freq typhoon - 1 freq |
MetaPhone code - TFM tfmmuh - 1 freq tyvm - 1 freq |
TYVM |
| Time to execute Levenshtein function - 0.489930 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.740760 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.058775 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.090382 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.001106 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. |