| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thatcher (0) - 24 freq thatchers (1) - 1 freq thatched (1) - 4 freq hatches (2) - 4 freq watcher (2) - 1 freq thatch (2) - 5 freq hatchet (2) - 1 freq thatch't (2) - 1 freq thatchin (2) - 2 freq teacher (2) - 370 freq catcher (2) - 2 freq snatcher (2) - 1 freq taicher (2) - 3 freq whather (2) - 15 freq hatched (2) - 9 freq thratched (2) - 1 freq thither (2) - 1 freq hatchery (2) - 2 freq stretcher (3) - 2 freq patches (3) - 22 freq satchel (3) - 8 freq hasher (3) - 1 freq catches (3) - 34 freq trencher (3) - 3 freq waatched (3) - 43 freq |
thatcher (0) - 24 freq thatched (2) - 4 freq thatchers (2) - 1 freq thatchin (3) - 2 freq thither (3) - 1 freq thatch (3) - 5 freq hatchery (3) - 2 freq whather (4) - 15 freq hatched (4) - 9 freq taicher (4) - 3 freq thratched (4) - 1 freq thatcherite (4) - 2 freq hatches (4) - 4 freq snatcher (4) - 1 freq hatchet (4) - 1 freq watcher (4) - 1 freq catcher (4) - 2 freq thatch't (4) - 1 freq teacher (4) - 370 freq teucher (5) - 4 freq t'other (5) - 1 freq truncher (5) - 2 freq shither (5) - 4 freq tyocher (5) - 1 freq wheecher (5) - 2 freq |
SoundEx code - T326 thatcher - 24 freq tadger - 3 freq thatcherite - 2 freq thatchers - 1 freq thatcherites - 1 freq tadjer - 1 freq thedecor - 4 freq thatcorbynista - 1 freq |
MetaPhone code - 0XR thatcher - 24 freq |
THATCHER |
| Time to execute Levenshtein function - 0.314881 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.398613 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.029724 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.037527 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.000895 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. |