| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| karcher (0) - 1 freq archer (1) - 9 freq harsher (2) - 2 freq taicher (2) - 3 freq marches (2) - 16 freq marchen (2) - 1 freq arches (2) - 17 freq lurcher (2) - 1 freq watcher (2) - 1 freq marched (2) - 15 freq aircher (2) - 1 freq parched (2) - 9 freq pawcher (2) - 1 freq catcher (2) - 2 freq marche (2) - 1 freq archers (2) - 1 freq farther (2) - 15 freq laicher (2) - 5 freq arched (2) - 3 freq acher (2) - 1 freq manche (3) - 1 freq keeched (3) - 4 freq sanchar (3) - 1 freq barrier (3) - 13 freq marchit (3) - 2 freq |
karcher (0) - 1 freq archer (2) - 9 freq lurcher (3) - 1 freq aircher (3) - 1 freq laicher (4) - 5 freq archers (4) - 1 freq arched (4) - 3 freq farther (4) - 15 freq acher (4) - 1 freq richer (4) - 15 freq roucher (4) - 2 freq brocher (4) - 2 freq marche (4) - 1 freq rocher (4) - 5 freq marchen (4) - 1 freq catcher (4) - 2 freq harsher (4) - 2 freq marches (4) - 16 freq arches (4) - 17 freq taicher (4) - 3 freq parched (4) - 9 freq pawcher (4) - 1 freq watcher (4) - 1 freq marched (4) - 15 freq bucher (5) - 1 freq |
SoundEx code - K626 kirkyaird - 82 freq kirkyard - 24 freq kirkyerd - 2 freq kirk-yaird - 4 freq kirkyairds - 10 freq kirkyaird-hoast - 1 freq kirkyaird's - 1 freq karcher - 1 freq keyworkerlife - 1 freq kerrsremovals - 1 freq |
MetaPhone code - KRXR courtiour - 1 freq crasher - 1 freq karcher - 1 freq crichar - 151 freq |
KARCHER |
| Time to execute Levenshtein function - 0.315899 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.382599 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.072263 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.077685 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.000911 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. |