| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| airchis (0) - 1 freq airches (1) - 12 freq mairchis (1) - 1 freq airchin (1) - 3 freq airchie (1) - 71 freq airis (2) - 1 freq aircht (2) - 1 freq orchis (2) - 1 freq archin (2) - 1 freq airch (2) - 12 freq mairchit (2) - 5 freq sairchin (2) - 3 freq awrchi (2) - 1 freq mairches (2) - 32 freq sairches (2) - 1 freq arches (2) - 17 freq inchis (2) - 1 freq aircs (2) - 1 freq aircher (2) - 1 freq airchers (2) - 7 freq airched (2) - 5 freq mairchin (2) - 35 freq airchee (2) - 1 freq airchin's (2) - 1 freq airchie's (2) - 18 freq |
airchis (0) - 1 freq airches (1) - 12 freq airchie (2) - 71 freq arches (2) - 17 freq orchis (2) - 1 freq mairchis (2) - 1 freq airchin (2) - 3 freq airched (3) - 5 freq airchers (3) - 7 freq aircher (3) - 1 freq airchee (3) - 1 freq iurches (3) - 1 freq riches (3) - 23 freq archie (3) - 92 freq airchie's (3) - 18 freq erches (3) - 1 freq aircs (3) - 1 freq archin (3) - 1 freq inchis (3) - 1 freq aircht (3) - 1 freq mairches (3) - 32 freq sairches (3) - 1 freq airch (3) - 12 freq perches (4) - 2 freq arch (4) - 13 freq |
SoundEx code - A622 airches - 12 freq arches - 17 freq arses - 7 freq archie's - 14 freq archaic - 3 freq airses - 3 freq argos - 8 freq arises - 5 freq airchie's - 18 freq archwyes - 1 freq airch-stanes - 1 freq air-kissin - 1 freq argies - 9 freq airchis - 1 freq archaisms - 2 freq archaisers - 1 freq archaisin - 2 freq argus - 1 freq archesuk - 1 freq arisaig - 1 freq arse-cockle - 1 freq argqkyugbw - 1 freq airqazbe - 1 freq |
MetaPhone code - ARXS airches - 12 freq arches - 17 freq archie's - 14 freq airchie's - 18 freq airchis - 1 freq |
AIRCHIS |
| Time to execute Levenshtein function - 0.206711 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.352393 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.027165 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.037482 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.000909 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. |