Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
captioun (0) - 1 freq caption (1) - 1 freq caution (2) - 9 freq natioun (2) - 5 freq cautious (2) - 8 freq actioun (2) - 15 freq campioun (2) - 1 freq mautioun (2) - 1 freq naitioun (2) - 7 freq optioun (2) - 1 freq captions (2) - 1 freq captin (2) - 2 freq sectioun (3) - 7 freq creatioun (3) - 1 freq castin (3) - 48 freq rattoun (3) - 1 freq editioun (3) - 2 freq cast-doun (3) - 1 freq captor (3) - 1 freq receptioun (3) - 1 freq caxton (3) - 1 freq mentioun (3) - 1 freq capsizin (3) - 1 freq staitioun (3) - 3 freq quastioun (3) - 10 freq |
captioun (0) - 1 freq caption (1) - 1 freq captin (2) - 2 freq captions (3) - 1 freq optioun (3) - 1 freq ceptin (3) - 6 freq capten (3) - 3 freq captain (3) - 71 freq caution (3) - 9 freq actioun (3) - 15 freq capturin (4) - 1 freq exceptioun (4) - 1 freq captur (4) - 1 freq cappin (4) - 1 freq carton (4) - 7 freq option (4) - 51 freq cartin (4) - 1 freq action (4) - 138 freq adaption (4) - 1 freq capon (4) - 1 freq captir (4) - 1 freq canton (4) - 2 freq captive (4) - 4 freq calton (4) - 10 freq cairtoun (4) - 1 freq |
SoundEx code - C135 captain - 71 freq chieftains - 1 freq chieftain - 10 freq ceptin - 6 freq caption - 1 freq captain's - 6 freq capten's - 1 freq captin's - 1 freq captin - 2 freq capten - 3 freq captains - 3 freq chieftain's - 1 freq coof-tongued - 2 freq chaptane - 1 freq ceptna - 2 freq cheiftainesses - 1 freq captioun - 1 freq coftin - 1 freq captions - 1 freq co-bidin - 1 freq cheftomkerridge - 1 freq chieftan - 1 freq captainjamtart - 1 freq |
MetaPhone code - KPXN caption - 1 freq captioun - 1 freq |
CAPTIOUN |
Time to execute Levenshtein function - 0.211419 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.393472 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.029628 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.040373 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.000811 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. |