| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| capacity (0) - 38 freq capacitie (2) - 1 freq capacityin (2) - 1 freq calamity (2) - 5 freq incapacity (2) - 3 freq mancity (3) - 2 freq cappit (3) - 3 freq clarity (3) - 13 freq banality (3) - 1 freq charity (3) - 41 freq audacity (3) - 4 freq rapidity (3) - 1 freq scarcity (3) - 2 freq papacy (3) - 1 freq maachty (3) - 1 freq caracts (3) - 1 freq cavity (3) - 2 freq capability (3) - 1 freq parity (3) - 2 freq captivity (3) - 1 freq pacify (3) - 2 freq capita (3) - 1 freq veracity (3) - 2 freq chicity (3) - 146 freq alacrity (3) - 1 freq |
capacity (0) - 38 freq capacitie (2) - 1 freq incapacity (3) - 3 freq capacityin (3) - 1 freq capita (4) - 1 freq cappit (4) - 3 freq paucity (4) - 1 freq chicity (4) - 146 freq calamity (4) - 5 freq pacify (5) - 2 freq compact (5) - 7 freq veracity (5) - 2 freq expecit (5) - 2 freq coppit (5) - 3 freq upact (5) - 1 freq impact (5) - 40 freq captivity (5) - 1 freq pact (5) - 10 freq cuppit (5) - 3 freq concaity (5) - 1 freq parity (5) - 2 freq rapidity (5) - 1 freq charity (5) - 41 freq clarity (5) - 13 freq mancity (5) - 2 freq |
SoundEx code - C123 capacitie - 1 freq chubbiest - 1 freq capacity - 38 freq capsten - 1 freq cheapskate - 2 freq cpg-scots - 1 freq cheapest - 3 freq capacityin - 1 freq cap-stane - 1 freq capstane - 1 freq ccfest - 2 freq cpksoutar - 3 freq capstick - 1 freq |
MetaPhone code - KPST capacitie - 1 freq capacity - 38 freq |
CAPACITY |
| Time to execute Levenshtein function - 0.211903 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.385641 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.027750 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.039829 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.000916 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. |