Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hefty (1) - 8 freq lefty (1) - 2 freq eftyr (1) - 1 freq emty (1) - 3 freq epty (1) - 1 freq efty' (1) - 1 freq eft (1) - 3 freq nesty (2) - 38 freq fth (2) - 2 freq fsy (2) - 1 freq eff (2) - 13 freq eftur (2) - 1 freq eit' (2) - 2 freq aft (2) - 69 freq usty (2) - 1 freq eit (2) - 644 freq peaty (2) - 4 freq eoftn (2) - 1 freq orty (2) - 1 freq waty (2) - 1 freq pety (2) - 2 freq fufty (2) - 6 freq onty (2) - 3 freq fy (2) - 7 freq et (2) - 256 freq |
eft (1) - 3 freq ft (2) - 19 freq afte (2) - 1 freq oft (2) - 5 freq hefty (2) - 8 freq aft (2) - 69 freq lefty (2) - 2 freq fte (2) - 1 freq emty (2) - 3 freq eftyr (2) - 1 freq epty (2) - 1 freq efty' (2) - 1 freq afta (2) - 1 freq fite (3) - 199 freq fat (3) - 297 freq lofty (3) - 4 freq ect (3) - 25 freq efl (3) - 2 freq city (3) - 288 freq paty (3) - 1 freq fut (3) - 28 freq deity (3) - 3 freq wety (3) - 4 freq fita (3) - 1 freq fet (3) - 2 freq |
SoundEx code - E130 evyte - 2 freq evade - 2 freq e-boat - 2 freq eft - 3 freq ebbit - 1 freq effete - 4 freq ev'dy - 1 freq evite - 12 freq eveit - 3 freq evdy - 7 freq ept - 1 freq ebbhid - 1 freq efty' - 1 freq epty - 1 freq |
MetaPhone code - EFT eight - 69 freq eaught - 1 freq evyte - 2 freq evade - 2 freq eft - 3 freq eeight - 1 freq eighty - 13 freq effete - 4 freq ev'dy - 1 freq eyght - 4 freq evite - 12 freq eveit - 3 freq evdy - 7 freq €œeight - 1 freq €˜eighty - 1 freq efty' - 1 freq |
EFTY |
Time to execute Levenshtein function - 0.213930 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.395046 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.028033 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.038714 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.001047 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. |