| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thatched (0) - 4 freq hatched (1) - 9 freq thatcher (1) - 24 freq thratched (1) - 1 freq titched (2) - 2 freq hitched (2) - 6 freq swatched (2) - 6 freq matched (2) - 10 freq watched (2) - 259 freq hatchet (2) - 1 freq hotched (2) - 2 freq waatched (2) - 43 freq thatchers (2) - 1 freq teached (2) - 8 freq twitched (2) - 7 freq catched (2) - 83 freq ecatched (2) - 1 freq latched (2) - 2 freq eatched (2) - 1 freq thatch (2) - 5 freq hatches (2) - 4 freq platched (2) - 2 freq vratched (2) - 2 freq flatched (2) - 1 freq snatched (2) - 9 freq |
thatched (0) - 4 freq hatched (2) - 9 freq thratched (2) - 1 freq thatcher (2) - 24 freq hotched (3) - 2 freq thatchin (3) - 2 freq thatch (3) - 5 freq twitched (3) - 7 freq titched (3) - 2 freq hitched (3) - 6 freq vratched (4) - 2 freq flatched (4) - 1 freq hatches (4) - 4 freq attached (4) - 21 freq heetched (4) - 1 freq thatch't (4) - 1 freq patched (4) - 2 freq snatched (4) - 9 freq platched (4) - 2 freq hatchet (4) - 1 freq watched (4) - 259 freq swatched (4) - 6 freq matched (4) - 10 freq eatched (4) - 1 freq thatchers (4) - 1 freq |
SoundEx code - T323 thatched - 4 freq tottiest - 6 freq twitched - 7 freq thatch't - 1 freq tidesedge - 1 freq titch't - 1 freq titched - 2 freq th'ootside - 1 freq twa-edged - 1 freq totiest - 1 freq titcht - 1 freq tweetiesheed - 1 freq too-tight - 1 freq toadstool - 1 freq tweetstreetocc - 8 freq |
MetaPhone code - 0XT thocht - 2668 freq thatched - 4 freq thochtie - 56 freq thoucht - 119 freq thochty - 7 freq thatch't - 1 freq thocht-' - 1 freq thoecht - 2 freq €˜thocht - 3 freq thowcht - 1 freq |
THATCHED |
| Time to execute Levenshtein function - 0.229626 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.381251 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.033928 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.042194 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.000945 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. |