| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| archaic (0) - 2 freq aramaic (2) - 3 freq archie (2) - 92 freq archin (2) - 1 freq archaeo (2) - 1 freq arctic (2) - 21 freq armchair (2) - 6 freq chai (3) - 1 freq chait (3) - 1 freq erchie (3) - 59 freq urchin (3) - 1 freq marchin (3) - 23 freq orchart (3) - 9 freq bacchic (3) - 2 freq archaisms (3) - 2 freq archers (3) - 1 freq archway (3) - 2 freq marchit (3) - 2 freq archer (3) - 9 freq achim (3) - 2 freq arch (3) - 13 freq arhin (3) - 1 freq orchard (3) - 8 freq arsenic (3) - 1 freq archwye (3) - 4 freq |
archaic (0) - 2 freq arctic (3) - 21 freq archin (3) - 1 freq archaeo (3) - 1 freq archie (3) - 92 freq arch (4) - 13 freq anarchic (4) - 1 freq archied (4) - 1 freq chic (4) - 10 freq archer (4) - 9 freq orchid (4) - 5 freq arched (4) - 3 freq airchis (4) - 1 freq airchie (4) - 71 freq archwye (4) - 4 freq archway (4) - 2 freq urchin (4) - 1 freq armchair (4) - 6 freq aramaic (4) - 3 freq archive (4) - 26 freq erchie (4) - 59 freq airchin (4) - 3 freq arches (4) - 17 freq orchis (4) - 1 freq artic (5) - 2 freq |
SoundEx code - A622 airches - 12 freq arches - 17 freq arses - 6 freq archie's - 14 freq archaic - 2 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 - ARXK archaic - 2 freq |
ARCHAIC |
| Time to execute Levenshtein function - 0.418912 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.912632 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.076672 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.082989 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.000917 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. |