| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tamhere (0) - 1 freq adhere (2) - 7 freq tamper (2) - 1 freq there (2) - 6822 freq anhere (2) - 1 freq tamer (2) - 2 freq there (3) - 1 freq amdee (3) - 1 freq ihere (3) - 6 freq 'here (3) - 51 freq taser (3) - 3 freq stammered (3) - 4 freq tempers (3) - 2 freq damper (3) - 3 freq theyre (3) - 6 freq tazper (3) - 1 freq rather (3) - 114 freq yammered (3) - 8 freq taivert (3) - 2 freq a'where (3) - 1 freq tamet (3) - 1 freq tasered (3) - 1 freq hammers (3) - 6 freq affere (3) - 1 freq yammert (3) - 1 freq |
tamhere (0) - 1 freq tamer (3) - 2 freq there (3) - 6822 freq tamper (3) - 1 freq tither (4) - 202 freq taither (4) - 1 freq topher (4) - 1 freq ather (4) - 3 freq thare (4) - 505 freq tether (4) - 18 freq timber (4) - 4 freq tother (4) - 1 freq timbre (4) - 2 freq timmer (4) - 80 freq tamar (4) - 2 freq ticher (4) - 3 freq temper (4) - 50 freq thre (4) - 2 freq teacher (4) - 370 freq tther (4) - 6 freq taicher (4) - 3 freq tamara (4) - 16 freq ther (4) - 111 freq timer (4) - 6 freq tocher (4) - 25 freq |
SoundEx code - T560 thunner - 74 freq thinner - 14 freq the-morra - 2 freq tanner - 10 freq tomorrow - 41 freq timmer - 80 freq tenure - 4 freq tumour - 6 freq themorra - 24 freq tenner - 25 freq thonner - 45 freq 'thonner - 1 freq thonner' - 1 freq toner - 1 freq timer - 6 freq tamar - 2 freq ten'er - 1 freq 'tamara - 1 freq tamara - 16 freq tamer - 2 freq themarra - 1 freq thoner - 2 freq tenor - 4 freq tuner - 1 freq tomorrow' - 1 freq twa-hunner - 1 freq tonner - 1 freq thoumire - 2 freq thunnery - 1 freq to-morrow - 1 freq thonner - 1 freq tinner - 1 freq tomorrow - 1 freq tenior - 1 freq tommorrow - 1 freq twa-hauner - 1 freq tamhere - 1 freq timor - 1 freq |
MetaPhone code - TMHR tamhere - 1 freq |
TAMHERE |
| Time to execute Levenshtein function - 0.199177 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.369795 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.027900 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.037447 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.000912 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. |