| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| autocar (0) - 1 freq autocue (2) - 1 freq autocrat (2) - 4 freq autos (3) - 1 freq althar (3) - 5 freq atower (3) - 1 freq auroch (3) - 2 freq altar (3) - 23 freq stoar (3) - 1 freq auto (3) - 5 freq outower (3) - 5 freq attar (3) - 1 freq ashoar (3) - 3 freq tutor (3) - 8 freq arrochar (3) - 1 freq afoar (3) - 15 freq autosort (3) - 1 freq customar (3) - 1 freq autopsy (3) - 2 freq succar (3) - 3 freq autonym (3) - 1 freq aocau (3) - 1 freq alomar (3) - 1 freq astor (3) - 1 freq atour (3) - 11 freq |
autocar (0) - 1 freq autocue (3) - 1 freq autocrat (3) - 4 freq atour (4) - 11 freq tutor (4) - 8 freq outcam (4) - 1 freq author (4) - 37 freq outcry (4) - 1 freq attar (4) - 1 freq attour (4) - 5 freq tobar (4) - 2 freq atower (4) - 1 freq outower (4) - 5 freq scar (5) - 16 freq accur (5) - 1 freq car (5) - 413 freq juicer (5) - 1 freq yitoch (5) - 1 freq tower (5) - 46 freq outowre (5) - 1 freq atray (5) - 2 freq uther (5) - 9 freq acair (5) - 1 freq at'r (5) - 1 freq outch (5) - 1 freq |
SoundEx code - A326 adjourn - 3 freq adjourns - 2 freq autographed - 2 freq aithsworn - 4 freq autocar - 1 freq attackers - 1 freq autographs - 2 freq autograph - 1 freq adwisory - 14 freq autocrat - 4 freq autosort - 1 freq autocorrect - 7 freq autocorrects - 1 freq adcramps - 1 freq aetshirts - 2 freq aetgraphics - 1 freq |
MetaPhone code - ATKR autocar - 1 freq |
AUTOCAR |
| Time to execute Levenshtein function - 0.174121 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.338881 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.027982 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.037155 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.000984 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. |