| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thatcherites (0) - 1 freq thatcherite (1) - 2 freq thatchers (3) - 1 freq hatchets (4) - 1 freq thatcher (4) - 24 freq machetes (5) - 1 freq hatches (5) - 4 freq tatterie (5) - 1 freq hatchit (5) - 2 freq traicherous (5) - 2 freq tangerines (5) - 5 freq teacher's (5) - 24 freq watchees (5) - 1 freq catchers (5) - 1 freq athritis (5) - 1 freq wateries (5) - 1 freq gatherings (5) - 7 freq fasheries (5) - 1 freq hatchet (5) - 1 freq shitherie (5) - 1 freq waatchers (5) - 3 freq thochties (5) - 1 freq taichers (5) - 2 freq thatched (5) - 4 freq 'katherine (5) - 1 freq |
thatcherites (0) - 1 freq thatcherite (2) - 2 freq thatchers (4) - 1 freq thatcher (6) - 24 freq hatchets (6) - 1 freq thatch't (7) - 1 freq nhscharities (7) - 1 freq thearchers (7) - 1 freq otherchrises (7) - 1 freq thochties (7) - 1 freq thoochts (8) - 1 freq thochts (8) - 330 freq thatchin (8) - 2 freq snatchets (8) - 1 freq watchers (8) - 11 freq hatche's (8) - 1 freq hatchery (8) - 2 freq snatchers (8) - 1 freq thouchts (8) - 22 freq teachers (8) - 227 freq thatched (8) - 4 freq trachonitis (8) - 2 freq taichers (8) - 2 freq catchers (8) - 1 freq traicherous (8) - 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 - 0XRTS thatcherites - 1 freq |
THATCHERITES |
| Time to execute Levenshtein function - 0.250407 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.387152 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.027751 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.043577 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.000921 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. |