Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
deleted (0) - 4 freq depleted (1) - 1 freq delete (1) - 9 freq beleted (1) - 1 freq deflated (2) - 9 freq delite (2) - 4 freq deluded (2) - 1 freq detected (2) - 1 freq elected (2) - 10 freq deflected (2) - 2 freq diluted (2) - 5 freq belted (2) - 15 freq deletit (2) - 3 freq deserted (2) - 5 freq delyte (2) - 4 freq deemed (2) - 13 freq devoted (2) - 4 freq declered (2) - 2 freq belated (2) - 6 freq delayed (2) - 4 freq weeted (2) - 1 freq delegated (2) - 2 freq teeted (2) - 1 freq delved (2) - 2 freq 'elected (2) - 1 freq |
deleted (0) - 4 freq diluted (2) - 5 freq dilated (2) - 1 freq beleted (2) - 1 freq depleted (2) - 1 freq delete (2) - 9 freq delytes (3) - 1 freq leeted (3) - 1 freq delegated (3) - 2 freq debated (3) - 3 freq delved (3) - 2 freq elated (3) - 3 freq dented (3) - 2 freq related (3) - 31 freq melted (3) - 10 freq pelted (3) - 5 freq defeated (3) - 7 freq delayed (3) - 4 freq elted (3) - 1 freq delled (3) - 2 freq devoted (3) - 4 freq delyte (3) - 4 freq belted (3) - 15 freq deletit (3) - 3 freq delite (3) - 4 freq |
SoundEx code - D433 delytit - 3 freq delitit - 3 freq deleted - 4 freq dilated - 1 freq diluted - 5 freq delytit-like - 1 freq deluded - 1 freq deletit - 3 freq €˜diluted - 1 freq deludedly - 1 freq deludit - 1 freq dollydaydream - 6 freq |
MetaPhone code - TLTT tiltit - 7 freq delytit - 3 freq delitit - 3 freq tilted - 5 freq deleted - 4 freq dilated - 1 freq diluted - 5 freq tiltet - 1 freq deluded - 1 freq tltit - 1 freq deletit - 3 freq €˜diluted - 1 freq deludit - 1 freq |
DELETED |
Time to execute Levenshtein function - 0.296320 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.520678 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.058879 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.038841 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.000941 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. |