| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| caspar (0) - 1 freq casper (1) - 1 freq aspar (1) - 1 freq capper (2) - 2 freq appar (2) - 2 freq castan (2) - 1 freq cupar (2) - 5 freq cesar (2) - 2 freq cassat (2) - 1 freq caster (2) - 2 freq caar (2) - 1 freq raspan (2) - 1 freq coupar (2) - 3 freq caesar (2) - 17 freq casual (2) - 22 freq castor (2) - 3 freq carpark (2) - 5 freq nascar (2) - 2 freq papar (2) - 2 freq camper (2) - 1 freq casa (2) - 1 freq caviar (2) - 11 freq rasper (2) - 1 freq spar (2) - 14 freq callar (2) - 4 freq |
caspar (0) - 1 freq casper (1) - 1 freq aspar (2) - 1 freq castor (3) - 3 freq caesar (3) - 17 freq spar (3) - 14 freq coupar (3) - 3 freq camper (3) - 1 freq rasper (3) - 1 freq caster (3) - 2 freq caper (3) - 14 freq cupar (3) - 5 freq capper (3) - 2 freq cesar (3) - 2 freq coapper (4) - 1 freq copper (4) - 22 freq cesare (4) - 1 freq compare (4) - 58 freq spare (4) - 98 freq despare (4) - 2 freq sper (4) - 1 freq csp (4) - 2 freq csr (4) - 1 freq compair (4) - 1 freq sapr (4) - 1 freq |
SoundEx code - C216 casper - 1 freq cockbrig - 2 freq cage-burd - 1 freq cockburn - 9 freq cockburns - 2 freq cockburnspeth - 1 freq chessboard - 2 freq caspar - 1 freq ceasefire - 1 freq chess-brod - 1 freq chessboord - 1 freq cheeseburger - 1 freq coachbrettblair - 1 freq cocksparra - 1 freq cascbar - 1 freq cakefridge - 1 freq |
MetaPhone code - KSPR casper - 1 freq caspar - 1 freq |
CASPAR |
| Time to execute Levenshtein function - 0.177938 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.346120 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.028367 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.036922 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.000838 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. |