| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| arches (0) - 16 freq archer (1) - 3 freq airches (1) - 6 freq aches (1) - 6 freq erches (1) - 1 freq arched (1) - 2 freq marches (1) - 7 freq archers (1) - 1 freq archie's (2) - 4 freq farces (2) - 1 freq merches (2) - 1 freq acher (2) - 1 freq torches (2) - 14 freq airchis (2) - 1 freq arch (2) - 9 freq arraes (2) - 1 freq catches (2) - 20 freq mairches (2) - 21 freq karcher (2) - 1 freq aces (2) - 4 freq lauches (2) - 1 freq archives (2) - 8 freq perches (2) - 2 freq ache (2) - 11 freq inches (2) - 75 freq |
arches (0) - 16 freq erches (1) - 1 freq airches (1) - 6 freq riches (2) - 18 freq archers (2) - 1 freq orchis (2) - 1 freq airchis (2) - 1 freq aches (2) - 6 freq marches (2) - 7 freq arched (2) - 2 freq archer (2) - 3 freq archwyes (3) - 1 freq arcades (3) - 2 freq creches (3) - 1 freq archesuk (3) - 1 freq searches (3) - 2 freq apaches (3) - 3 freq archie (3) - 39 freq rochs (3) - 1 freq archin (3) - 1 freq sairches (3) - 1 freq alchies (3) - 1 freq reaches (3) - 16 freq taiches (3) - 1 freq aircher (3) - 1 freq |
SoundEx code - A622 airches - 6 freq argos - 8 freq arises - 4 freq arches - 16 freq airchie's - 18 freq arses - 5 freq archwyes - 1 freq airch-stanes - 1 freq archie's - 4 freq air-kissin - 1 freq argies - 4 freq airchis - 1 freq archaisms - 1 freq argus - 1 freq airses - 1 freq archesuk - 1 freq arisaig - 1 freq arse-cockle - 1 freq argqkyugbw - 1 freq airqazbe - 1 freq |
MetaPhone code - ARXS airches - 6 freq arches - 16 freq airchie's - 18 freq archie's - 4 freq airchis - 1 freq |
ARCHES |
| Time to execute Levenshtein function - 0.144132 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.270285 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.024475 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.031437 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.000897 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. |