| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tyauvin (0) - 19 freq tyavvin (1) - 1 freq tcyauvin (1) - 1 freq teyauvin (1) - 1 freq tyaavin (1) - 2 freq tyavin (1) - 2 freq tyauv (2) - 1 freq taukin (2) - 3 freq cauvin (2) - 1 freq byaavin (2) - 1 freq wauvin (2) - 1 freq yaavin (2) - 3 freq chauvin (2) - 4 freq tyauve (2) - 20 freq tyauved (2) - 5 freq sauvin (2) - 1 freq pyauvie (2) - 1 freq yaukin (2) - 1 freq tyauves (2) - 2 freq tcyaavin (2) - 1 freq hausin (3) - 2 freq shavin (3) - 11 freq teasin (3) - 9 freq calvin (3) - 8 freq haunin (3) - 7 freq |
tyauvin (0) - 19 freq tyaavin (1) - 2 freq teyauvin (1) - 1 freq tyavin (1) - 2 freq tcyauvin (2) - 1 freq tyavvin (2) - 1 freq tyauved (3) - 5 freq sauvin (3) - 1 freq tyauves (3) - 2 freq tyauve (3) - 20 freq tovin (3) - 8 freq tcyaavin (3) - 1 freq cauvin (3) - 1 freq tyauv (3) - 1 freq byaavin (3) - 1 freq taukin (3) - 3 freq wauvin (3) - 1 freq yaavin (3) - 3 freq tynin (4) - 20 freq wyvin (4) - 15 freq mavin (4) - 1 freq taviani (4) - 2 freq tyan (4) - 2 freq trvin (4) - 1 freq taein (4) - 6 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 - TYFN tyauvin - 19 freq tyavin - 2 freq tyaavin - 2 freq tyavvin - 1 freq teyauvin - 1 freq |
TYAUVIN |
| Time to execute Levenshtein function - 0.190831 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.343628 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.027931 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.037704 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.000867 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. |