| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| antit (0) - 1 freq mantit (1) - 2 freq rantit (1) - 1 freq cantit (1) - 1 freq gantit (1) - 10 freq intit (1) - 11 freq wantit (1) - 279 freq hantit (1) - 3 freq lantit (1) - 1 freq anti (1) - 11 freq pantit (1) - 2 freq antic (1) - 1 freq actit (1) - 9 freq santit (1) - 2 freq hatit (2) - 15 freq astir (2) - 1 freq tartit (2) - 1 freq endit (2) - 55 freq anyntit (2) - 1 freq saatit (2) - 1 freq asti (2) - 1 freq inti't (2) - 1 freq antiek (2) - 1 freq aftir (2) - 1 freq annint (2) - 1 freq |
antit (0) - 1 freq intit (1) - 11 freq santit (2) - 2 freq pantit (2) - 2 freq actit (2) - 9 freq anti (2) - 11 freq entity (2) - 17 freq unitit (2) - 29 freq notit (2) - 12 freq antic (2) - 1 freq lantit (2) - 1 freq rantit (2) - 1 freq mantit (2) - 2 freq gantit (2) - 10 freq cantit (2) - 1 freq wantit (2) - 279 freq hantit (2) - 3 freq pintit (3) - 14 freq ant (3) - 8 freq jintit (3) - 1 freq unitet (3) - 3 freq haetit (3) - 1 freq anter (3) - 1 freq citit (3) - 2 freq ants (3) - 5 freq |
SoundEx code - A533 an-that's - 2 freq antidote - 2 freq antithesis - 1 freq anti-democratic - 2 freq antidemocratic - 1 freq anthat - 1 freq an-dat's - 1 freq annotatit - 1 freq antedatings - 2 freq antedatins - 1 freq antedatin - 1 freq antedates - 2 freq anti-authoritarian - 2 freq antidisestaiblishmentarianism - 1 freq antit - 1 freq €™andit - 1 freq anti-tax - 1 freq anti-tory - 1 freq andoed - 1 freq anti-diarrhoea - 1 freq andytelferlegge - 1 freq andydphilip - 1 freq andied - 1 freq andytawse - 1 freq antithetical - 1 freq anti-democracy - 2 freq andyedwardsr - 1 freq andytcarroll - 1 freq |
MetaPhone code - ANTT antit - 1 freq €™andit - 1 freq andoed - 1 freq andied - 1 freq |
ANTIT |
| Time to execute Levenshtein function - 0.200158 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.341598 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.028171 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.040128 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.000939 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. |