| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| exonered (0) - 1 freq foonered (2) - 1 freq exoner (2) - 1 freq poodered (3) - 10 freq exponed (3) - 4 freq towered (3) - 1 freq jowered (3) - 1 freq recovered (3) - 11 freq pioneered (3) - 1 freq lowered (3) - 25 freq sobered (3) - 1 freq tootered (3) - 2 freq pondered (3) - 4 freq dannered (3) - 1 freq ensnared (3) - 2 freq hovered (3) - 11 freq cornered (3) - 6 freq wannered (3) - 3 freq wunnered (3) - 44 freq dovered (3) - 6 freq entered (3) - 40 freq too'ered (3) - 1 freq pouered (3) - 4 freq tobered (3) - 1 freq hinnered (3) - 1 freq |
exonered (0) - 1 freq exoner (3) - 1 freq foonered (3) - 1 freq daunered (4) - 20 freq expired (4) - 3 freq pioneered (4) - 1 freq oxtered (4) - 7 freq launered (4) - 1 freq tooered (5) - 1 freq mannered (5) - 1 freq explored (5) - 4 freq dunnered (5) - 1 freq covered (5) - 124 freq pooered (5) - 3 freq hoovered (5) - 4 freq pokered (5) - 1 freq honeyed (5) - 1 freq footered (5) - 5 freq shooered (5) - 3 freq couered (5) - 1 freq flooered (5) - 1 freq foondered (5) - 3 freq donard (5) - 1 freq conrad (5) - 47 freq kinred (5) - 2 freq |
SoundEx code - E256 exoner - 1 freq eegnorant - 1 freq egg-merchant - 1 freq ex-senior - 1 freq eco-anarchists - 1 freq exoneratit - 1 freq exonered - 1 freq ecomarxism - 1 freq |
MetaPhone code - EKSNRT exonered - 1 freq |
EXONERED |
| Time to execute Levenshtein function - 0.195755 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.395331 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.030316 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.073740 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.001116 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. |