Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
tmv (0) - 1 freq rmv (1) - 1 freq tmi (1) - 1 freq tnv (1) - 1 freq mv (1) - 2 freq tv (1) - 208 freq t'v (1) - 1 freq tmj (1) - 1 freq tm (1) - 7 freq tmc (1) - 1 freq hmv (1) - 2 freq tme (1) - 3 freq kms (2) - 1 freq tuk (2) - 227 freq tia (2) - 2 freq tvs (2) - 2 freq €™v (2) - 67 freq rmp (2) - 1 freq thiv (2) - 19 freq mtm (2) - 1 freq fav (2) - 7 freq qv (2) - 3 freq amm (2) - 1 freq ten (2) - 638 freq pov (2) - 1 freq |
tmv (0) - 1 freq tmj (2) - 1 freq tm (2) - 7 freq tme (2) - 3 freq t'v (2) - 1 freq tmc (2) - 1 freq hmv (2) - 2 freq tv (2) - 208 freq rmv (2) - 1 freq tmi (2) - 1 freq tnv (2) - 1 freq mv (2) - 2 freq thev (3) - 3 freq qtmvu (3) - 1 freq tam (3) - 522 freq tems (3) - 1 freq tim' (3) - 43 freq mve (3) - 1 freq at'v (3) - 2 freq tump (3) - 1 freq utv (3) - 1 freq tenv (3) - 1 freq t've (3) - 5 freq tom (3) - 134 freq tum (3) - 17 freq |
SoundEx code - T510 thump - 33 freq thumb - 25 freq tomb - 31 freq tomboy - 1 freq tump - 1 freq tempo - 4 freq temp - 734 freq twa-an-a-hauf - 2 freq thomp - 1 freq thoomb - 6 freq tumb - 1 freq timpo - 1 freq temp- - 7 freq tmv - 1 freq tnv - 1 freq tomb” - 1 freq tmmf - 1 freq timehop - 1 freq tenv - 1 freq tywanb - 1 freq tonyip - 1 freq |
MetaPhone code - TMF dumphy - 50 freq damff - 1 freq dumfy - 3 freq tmv - 1 freq tmmf - 1 freq |
TMV |
Time to execute Levenshtein function - 0.389514 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.547580 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.072510 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.091331 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.000949 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. |