| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| airches (0) - 12 freq airchee (1) - 1 freq airchers (1) - 7 freq aircher (1) - 1 freq arches (1) - 17 freq airched (1) - 5 freq airchis (1) - 1 freq sairches (1) - 1 freq mairches (1) - 32 freq paitches (2) - 1 freq lurches (2) - 2 freq apaches (2) - 3 freq ditches (2) - 8 freq aircs (2) - 1 freq eitches (2) - 1 freq marches (2) - 16 freq airch (2) - 12 freq inches (2) - 98 freq airtcles (2) - 1 freq airchie's (2) - 18 freq bitches (2) - 6 freq circles (2) - 37 freq hitches (2) - 2 freq witches (2) - 35 freq finches (2) - 1 freq |
airches (0) - 12 freq arches (1) - 17 freq airchis (1) - 1 freq mairches (2) - 32 freq sairches (2) - 1 freq iurches (2) - 1 freq riches (2) - 23 freq erches (2) - 1 freq airchers (2) - 7 freq airchee (2) - 1 freq airched (2) - 5 freq aircher (2) - 1 freq arched (3) - 3 freq taiches (3) - 1 freq airchie (3) - 71 freq orchis (3) - 1 freq apaches (3) - 3 freq archers (3) - 1 freq lurches (3) - 2 freq merches (3) - 2 freq torches (3) - 14 freq aircht (3) - 1 freq niches (3) - 1 freq aches (3) - 10 freq perches (3) - 2 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 |
AIRCHES |
| Time to execute Levenshtein function - 0.198118 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.385847 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.027702 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.037919 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.000930 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. |