| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| teevecheid (0) - 9 freq 'teevecheid (1) - 4 freq teeveeheid (1) - 73 freq teevecheid's (2) - 1 freq 'teeveeheid (2) - 3 freq teeveeheid's (3) - 1 freq peeterheid (3) - 1 freq seeched (4) - 1 freq wheeched (4) - 47 freq neeborheid (4) - 2 freq meedowheid (4) - 1 freq cave-heid (4) - 2 freq tee-he'd (4) - 1 freq peterheid (4) - 25 freq teevee (4) - 1 freq overheid (4) - 2 freq serieched (4) - 1 freq breeched (4) - 2 freq teached (4) - 8 freq streeched (4) - 9 freq teechis (4) - 1 freq beseeched (4) - 1 freq fleeched (4) - 1 freq teetered (4) - 3 freq braecheid (4) - 1 freq |
teevecheid (0) - 9 freq teeveeheid (2) - 73 freq 'teevecheid (2) - 4 freq 'teeveeheid (4) - 3 freq teevecheid's (4) - 1 freq teached (5) - 8 freq teuched (5) - 4 freq heetchid (6) - 1 freq heetched (6) - 1 freq keeched (6) - 4 freq braecheid (6) - 1 freq fleeched (6) - 1 freq teecher (6) - 1 freq leeched (6) - 1 freq touched (6) - 75 freq titched (6) - 2 freq etched (6) - 13 freq tiched (6) - 2 freq tableheid (6) - 1 freq beseeched (6) - 1 freq reeched (6) - 1 freq eatched (6) - 1 freq overheid (6) - 2 freq teechis (6) - 1 freq peeterheid (6) - 1 freq |
SoundEx code - T123 tippexed - 1 freq twae-faced - 1 freq tapestry - 11 freq taupestries - 1 freq twa-faced - 3 freq top-stories - 1 freq tap-coat - 2 freq teevecheid - 9 freq 'teevecheid - 4 freq teevecheid's - 1 freq typesettin - 1 freq tip-exed - 1 freq tapestries - 1 freq tapster - 6 freq taipestrie - 1 freq tapestried - 1 freq tipster - 1 freq tapcoat - 1 freq tapesty - 1 freq tvosewd - 1 freq tbyjgste - 1 freq tavistockgirl - 1 freq tvzstkkkq - 1 freq tipsywitch - 1 freq tvewqksd - 1 freq thbaketal - 1 freq |
MetaPhone code - TFXT teevecheid - 9 freq 'teevecheid - 4 freq |
TEEVECHEID |
| Time to execute Levenshtein function - 0.348208 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.593080 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.027264 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.037712 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.000816 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. |