| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cap-stane (0) - 1 freq capstane (1) - 1 freq chestane (3) - 1 freq cauld-stane (3) - 1 freq sand-stane (3) - 1 freq castan (3) - 1 freq saunstane (3) - 1 freq dry-stane (3) - 2 freq hailstane (3) - 1 freq chaptane (3) - 1 freq dray-stane (3) - 2 freq lairstane (3) - 3 freq capsten (3) - 1 freq kie-stane (3) - 3 freq jamstane (3) - 1 freq sandstane (3) - 6 freq crib-stane (3) - 2 freq set-stane (3) - 1 freq sanstane (3) - 1 freq hertstane (4) - 1 freq harestanes (4) - 1 freq ae-same (4) - 1 freq capitall (4) - 3 freq capital (4) - 88 freq lodestane (4) - 1 freq |
cap-stane (0) - 1 freq capstane (2) - 1 freq capsten (4) - 1 freq kie-stane (5) - 3 freq cauld-stane (5) - 1 freq crib-stane (5) - 2 freq set-stane (5) - 1 freq causey-stane (5) - 1 freq dray-stane (5) - 2 freq chestane (5) - 1 freq castan (5) - 1 freq dry-stane (5) - 2 freq captain (6) - 71 freq caistin (6) - 1 freq cum-stained (6) - 1 freq castin (6) - 48 freq pakistan (6) - 3 freq free-stane (6) - 2 freq captin (6) - 2 freq casten (6) - 2 freq blue-stane (6) - 1 freq costan (6) - 1 freq palestyne (6) - 1 freq christan (6) - 1 freq heid-stane (6) - 1 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 - KPSTN capsten - 1 freq cap-stane - 1 freq capstane - 1 freq |
CAP-STANE |
| Time to execute Levenshtein function - 0.225409 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.393392 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.035260 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.051575 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.001108 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. |