| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ex-chair (0) - 1 freq erm-chair (2) - 1 freq ermchair (2) - 10 freq armchair (3) - 6 freq deckchair (3) - 2 freq machair (3) - 3 freq exchie (3) - 1 freq chair (3) - 219 freq enshair (3) - 1 freq exclaim (3) - 7 freq airm-chair (4) - 4 freq 'hair (4) - 2 freq ex-page (4) - 1 freq executor (4) - 4 freq cair (4) - 3 freq chaip (4) - 15 freq e-coli (4) - 1 freq enchant (4) - 2 freq acair (4) - 1 freq exchangin (4) - 4 freq excitin (4) - 33 freq 'thair (4) - 2 freq clair (4) - 56 freq char (4) - 2 freq schir (4) - 2 freq |
ex-chair (0) - 1 freq erm-chair (4) - 1 freq ermchair (4) - 10 freq exchie (5) - 1 freq machair (5) - 3 freq chair (5) - 219 freq armchair (5) - 6 freq cheir (6) - 9 freq sea-haar (6) - 1 freq rouchir (6) - 1 freq teachar (6) - 1 freq airmchair (6) - 8 freq denchir (6) - 1 freq machar (6) - 9 freq choir (6) - 16 freq vouchir (6) - 5 freq bow-cheir (6) - 3 freq teichar (6) - 2 freq crichar (6) - 151 freq schoir (6) - 1 freq t-shir (6) - 1 freq sanchar (6) - 1 freq ex-senior (6) - 1 freq chaer (6) - 1 freq echr (6) - 1 freq |
SoundEx code - E260 eager - 27 freq easier - 114 freq eesyer - 1 freq easjer - 1 freq egeria - 1 freq eezer - 1 freq ecairry - 1 freq ezra - 3 freq ex-chair - 1 freq eqr - 2 freq eser - 1 freq echr - 1 freq eeger - 1 freq |
MetaPhone code - EKSXR ex-chair - 1 freq |
EX-CHAIR |
| Time to execute Levenshtein function - 0.276937 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.391364 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.027406 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.037358 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.000972 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. |