| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ecoarner (0) - 1 freq coarner (1) - 47 freq corner (2) - 324 freq coarners (2) - 9 freq earner (2) - 2 freq canner (3) - 1 freq cornet (3) - 4 freq coarse (3) - 67 freq mourner (3) - 2 freq cornert (3) - 1 freq coroner (3) - 3 freq scourger (3) - 2 freq corer (3) - 1 freq carer (3) - 10 freq oarder (3) - 5 freq scorned (3) - 3 freq shoarter (3) - 1 freq exoner (3) - 1 freq scarier (3) - 1 freq coorser (3) - 4 freq earned (3) - 19 freq koarnir (3) - 2 freq warner (3) - 1 freq carney (3) - 1 freq learner (3) - 8 freq |
ecoarner (0) - 1 freq coarner (1) - 47 freq corner (2) - 324 freq earner (3) - 2 freq coroner (3) - 3 freq coarners (3) - 9 freq cornes (4) - 1 freq corners (4) - 36 freq i'corner (4) - 1 freq courier (4) - 6 freq carver (4) - 14 freq learner (4) - 8 freq corne (4) - 1 freq conner (4) - 2 freq career (4) - 66 freq carne (4) - 1 freq horner (4) - 2 freq coarn (4) - 51 freq carney (4) - 1 freq corned (4) - 8 freq carter (4) - 3 freq crooner (4) - 4 freq sorner (4) - 3 freq cornert (4) - 1 freq corer (4) - 1 freq |
SoundEx code - E265 ecoarner - 1 freq ecroun - 1 freq ecrin - 1 freq ee-screen - 1 freq excrement - 2 freq ecrml - 2 freq ee-sairin - 1 freq eagerness - 2 freq egrun - 1 freq ex-army - 1 freq ex-girnwud - 1 freq esrnbv - 1 freq |
MetaPhone code - EKRNR ecoarner - 1 freq |
ECOARNER |
| Time to execute Levenshtein function - 0.376056 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.493295 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.029055 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.041080 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.000944 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. |