| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| erches (0) - 1 freq perches (1) - 2 freq arches (1) - 17 freq merches (1) - 3 freq etched (2) - 13 freq ernes (2) - 1 freq leaches (2) - 3 freq eries (2) - 1 freq erchie (2) - 59 freq perched (2) - 20 freq lenches (2) - 1 freq marches (2) - 16 freq erles (2) - 1 freq benches (2) - 13 freq eichts (2) - 4 freq torches (2) - 14 freq echas (2) - 4 freq eitches (2) - 1 freq teaches (2) - 3 freq searches (2) - 4 freq fetches (2) - 4 freq belches (2) - 1 freq eccles (2) - 1 freq eccies (2) - 3 freq peaches (2) - 2 freq |
erches (0) - 1 freq arches (1) - 17 freq airches (2) - 12 freq iurches (2) - 1 freq orchis (2) - 1 freq riches (2) - 23 freq merches (2) - 3 freq perches (2) - 2 freq reaches (2) - 24 freq leeches (3) - 4 freq niches (3) - 1 freq arched (3) - 3 freq erchie's (3) - 6 freq echaes (3) - 2 freq archer (3) - 9 freq retches (3) - 1 freq airchis (3) - 1 freq erch (3) - 3 freq beaches (3) - 12 freq rochs (3) - 1 freq creches (3) - 1 freq lurches (3) - 2 freq aches (3) - 10 freq echoes (3) - 26 freq beeches (3) - 1 freq |
SoundEx code - E622 erses - 23 freq erchie's - 6 freq erika's - 2 freq erikasbairn - 1 freq erches - 1 freq erzygfvwvl - 1 freq eerjeestnoclueduprite - 1 freq ericajanepoet - 2 freq |
MetaPhone code - ERXS erchie's - 6 freq erches - 1 freq |
ERCHES |
| Time to execute Levenshtein function - 0.189776 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.519004 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.032646 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.071457 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.000906 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. |