| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ermchair (0) - 10 freq armchair (1) - 6 freq erm-chair (1) - 1 freq ex-chair (2) - 1 freq airmchair (2) - 8 freq royhair (3) - 3 freq eimhir (3) - 1 freq deckchair (3) - 2 freq erchie (3) - 59 freq enshair (3) - 1 freq crichar (3) - 151 freq chair (3) - 222 freq machair (3) - 3 freq archaic (3) - 2 freq mohair (3) - 2 freq drochaid (3) - 1 freq airmchairs (3) - 1 freq sumwhair (3) - 1 freq airm-chair (3) - 4 freq ersch (4) - 1 freq teichar (4) - 2 freq richtit (4) - 2 freq crochlin (4) - 1 freq ersche (4) - 1 freq somwhaur (4) - 1 freq |
ermchair (0) - 10 freq armchair (1) - 6 freq airmchair (2) - 8 freq erm-chair (2) - 1 freq airm-chair (4) - 4 freq machair (4) - 3 freq airmchairs (4) - 1 freq ex-chair (4) - 1 freq machar (5) - 9 freq sumwhair (5) - 1 freq rocher (5) - 5 freq archer (5) - 9 freq richer (5) - 15 freq rouchir (5) - 1 freq arrochar (5) - 1 freq eimhir (5) - 1 freq crichar (5) - 151 freq erchie (5) - 59 freq royhair (5) - 3 freq mohair (5) - 2 freq archaic (5) - 2 freq chair (5) - 222 freq archaeo (6) - 1 freq echr (6) - 1 freq moocher (6) - 2 freq |
SoundEx code - E652 earrins - 2 freq erying - 1 freq erms - 42 freq ermchair - 10 freq earnestly - 4 freq earrings - 7 freq eerins - 6 freq earnest - 13 freq ernest - 6 freq eerin's - 1 freq errins - 1 freq earns - 3 freq erns - 1 freq ee-wharms - 1 freq ern-cairriers - 1 freq erin's - 3 freq ernie's - 2 freq erm-chair - 1 freq eernest-like - 1 freq erne's - 1 freq euromosaic - 1 freq eerans - 1 freq ernes - 1 freq eringrieve - 7 freq eerrans - 1 freq |
MetaPhone code - ERMXR ermchair - 10 freq erm-chair - 1 freq |
ERMCHAIR |
| Time to execute Levenshtein function - 0.201817 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.351772 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.027191 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.037172 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.000842 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. |