| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tenv (0) - 1 freq tent (1) - 458 freq tens (1) - 13 freq ten (1) - 619 freq teng (1) - 1 freq tnv (1) - 1 freq ten' (1) - 1 freq env (1) - 1 freq tend (1) - 55 freq tiny (2) - 54 freq gent (2) - 10 freq leev (2) - 3 freq fehv (2) - 1 freq went (2) - 1912 freq stend (2) - 1 freq teip (2) - 2 freq taen (2) - 999 freq ee'v (2) - 1 freq teuk (2) - 221 freq sens (2) - 6 freq tear (2) - 100 freq tong (2) - 6 freq tmv (2) - 1 freq telc (2) - 1 freq cent (2) - 20 freq |
tenv (0) - 1 freq tnv (1) - 1 freq ten' (2) - 1 freq tend (2) - 55 freq env (2) - 1 freq teng (2) - 1 freq tent (2) - 458 freq tens (2) - 13 freq ten (2) - 619 freq teen (3) - 461 freq ting (3) - 49 freq tng (3) - 1 freq tone (3) - 153 freq tyna (3) - 1 freq tons (3) - 10 freq tean (3) - 1 freq tan (3) - 48 freq tien (3) - 3 freq tank (3) - 25 freq thuv (3) - 5 freq nev (3) - 6 freq tense (3) - 79 freq tulv (3) - 1 freq envy (3) - 25 freq tein (3) - 3 freq |
SoundEx code - T510 thump - 32 freq thumb - 24 freq tomb - 31 freq tomboy - 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 - TNF dounfaw - 5 freq doonfaa - 3 freq doonfa - 2 freq tnv - 1 freq dianeeva - 1 freq dunfy - 1 freq tenv - 1 freq |
TENV |
| Time to execute Levenshtein function - 0.250330 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.482908 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.034546 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.047383 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.001124 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. |