| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thievin (0) - 16 freq theevin (1) - 1 freq thretin (2) - 1 freq sievin (2) - 1 freq shielin (2) - 1 freq grievin (2) - 13 freq hivin (2) - 26 freq stievin (2) - 1 freq thrivin (2) - 26 freq thinnin (2) - 1 freq achievin (2) - 3 freq thickin (2) - 1 freq thiggin (2) - 2 freq hivvin (2) - 29 freq dievin (2) - 1 freq theivin (2) - 3 freq thieve (2) - 3 freq tiefin (2) - 3 freq hievins (2) - 1 freq heevin (2) - 9 freq haevin (2) - 2 freq hiein (2) - 1 freq ievin (2) - 1 freq hevin (2) - 20 freq shivvin (2) - 2 freq |
thievin (0) - 16 freq theevin (1) - 1 freq theivin (2) - 3 freq heevin (3) - 9 freq thieve (3) - 3 freq haevin (3) - 2 freq thein (3) - 23 freq thieved (3) - 1 freq achievin (3) - 3 freq hevin (3) - 20 freq thieves (3) - 24 freq hivin (3) - 26 freq thrivin (3) - 26 freq hivan (4) - 7 freq huvin (4) - 150 freq tyaavin (4) - 2 freq thern (4) - 1 freq hoovin (4) - 3 freq heavin (4) - 17 freq heivin (4) - 12 freq heeven (4) - 12 freq thraavin (4) - 1 freq thrain (4) - 1 freq thiv (4) - 19 freq havin (4) - 67 freq |
SoundEx code - T150 thievin - 16 freq tippm - 1 freq tovin - 8 freq tappin - 20 freq theivin - 3 freq two-penny - 1 freq tubin - 1 freq thavm - 4 freq tippin - 4 freq tyauvin - 18 freq typin - 14 freq tyavin - 2 freq teapin - 1 freq typin' - 1 freq toppen - 1 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 toppin - 4 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 - 0FN thievin - 16 freq theivin - 3 freq theevin - 1 freq theophanie - 1 freq |
THIEVIN |
| Time to execute Levenshtein function - 0.213406 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.400869 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.028341 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.039746 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.000946 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. |