| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| exoner (0) - 1 freq exonered (2) - 1 freq exponed (2) - 4 freq toner (2) - 1 freq goner (2) - 4 freq exminer (2) - 1 freq ebner (2) - 5 freq fooner (2) - 4 freq loner (2) - 1 freq thoner (2) - 2 freq sooner (2) - 29 freq shoner (2) - 1 freq einer (2) - 1 freq exne (2) - 1 freq ooner (2) - 2 freq earner (2) - 2 freq expone (2) - 2 freq exeter (2) - 4 freq doner (2) - 2 freq dooner (2) - 2 freq tanner (3) - 10 freq planer (3) - 1 freq boney (3) - 9 freq maner (3) - 4 freq done' (3) - 1 freq |
exoner (0) - 1 freq exne (3) - 1 freq einer (3) - 1 freq sooner (3) - 29 freq ooner (3) - 2 freq earner (3) - 2 freq doner (3) - 2 freq exeter (3) - 4 freq exonered (3) - 1 freq dooner (3) - 2 freq goner (3) - 4 freq toner (3) - 1 freq loner (3) - 1 freq exminer (3) - 1 freq ebner (3) - 5 freq fooner (3) - 4 freq jyner (4) - 30 freq gener (4) - 1 freq liner (4) - 4 freq meiner (4) - 2 freq keener (4) - 6 freq joyner (4) - 1 freq wiener (4) - 2 freq lner (4) - 1 freq finer (4) - 14 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 - EKSNR exoner - 1 freq |
EXONER |
| Time to execute Levenshtein function - 0.202443 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.351397 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.027342 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.040619 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.001187 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. |