| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| theevin (0) - 1 freq thievin (1) - 16 freq theivin (1) - 3 freq heevin (1) - 9 freq heerin (2) - 3 freq tweelin (2) - 2 freq sheenin (2) - 26 freq deevin (2) - 4 freq teein (2) - 2 freq heivin (2) - 12 freq teerin (2) - 5 freq heeven (2) - 12 freq eevin (2) - 5 freq thrivin (2) - 26 freq therein (2) - 3 freq wheelin (2) - 12 freq tweetin (2) - 20 freq hevin (2) - 20 freq heelin (2) - 1 freq sheetin (2) - 6 freq thretin (2) - 1 freq reevin (2) - 3 freq haevin (2) - 2 freq heefin (2) - 1 freq wheekin (2) - 3 freq |
theevin (0) - 1 freq theivin (1) - 3 freq thievin (1) - 16 freq heevin (2) - 9 freq hevin (3) - 20 freq haevin (3) - 2 freq therein (3) - 3 freq heavin (3) - 18 freq thein (3) - 23 freq thrivin (3) - 26 freq sheavin (3) - 2 freq theikin (3) - 2 freq theen (3) - 2 freq heivin (3) - 12 freq heeven (3) - 12 freq heaven (4) - 69 freq 'heaven (4) - 1 freq thraavin (4) - 1 freq thereon (4) - 1 freq thieved (4) - 1 freq tharein (4) - 1 freq thev (4) - 3 freq shaavin (4) - 1 freq thieve (4) - 3 freq heven (4) - 1 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 - 0FN thievin - 16 freq theivin - 3 freq theevin - 1 freq theophanie - 1 freq |
THEEVIN |
| Time to execute Levenshtein function - 0.609734 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.905193 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.093370 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.097425 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.000911 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. |