| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| chaser (0) - 9 freq chased (1) - 50 freq chase' (1) - 1 freq chase (1) - 51 freq chawer (1) - 2 freq chases (1) - 7 freq chaer (1) - 1 freq chaper (1) - 3 freq chose (2) - 62 freq chaved (2) - 1 freq chaucer (2) - 4 freq chaste (2) - 1 freq cheaper (2) - 15 freq chapper (2) - 2 freq clased (2) - 2 freq chafed (2) - 1 freq chave (2) - 3 freq caer (2) - 5 freq cease (2) - 10 freq chasse (2) - 2 freq shaker (2) - 1 freq coaster (2) - 18 freq phases (2) - 3 freq chalet (2) - 5 freq whaler (2) - 1 freq |
chaser (0) - 9 freq chases (2) - 7 freq chaper (2) - 3 freq chawer (2) - 2 freq chaer (2) - 1 freq chase (2) - 51 freq chased (2) - 50 freq chase' (2) - 1 freq closer (3) - 138 freq couser (3) - 2 freq chaise (3) - 3 freq cheer (3) - 154 freq chusen (3) - 2 freq char (3) - 2 freq chasit (3) - 2 freq chasm (3) - 2 freq chuse (3) - 9 freq chysen (3) - 1 freq chasies (3) - 1 freq chaiper (3) - 2 freq choaker (3) - 7 freq cher (3) - 6 freq chasan (3) - 2 freq chisel (3) - 10 freq choker (3) - 1 freq |
SoundEx code - C260 cooker - 21 freq couser - 2 freq cigar - 19 freq cheshire - 10 freq choisir - 1 freq cocker - 1 freq choaker - 7 freq chaser - 9 freq cesare - 1 freq cooser - 3 freq cashier - 1 freq cesar - 2 freq chowker - 7 freq cheugher - 1 freq cookery - 4 freq caesar - 17 freq caesarea - 1 freq checker - 5 freq choocher - 1 freq choker - 1 freq cicero - 1 freq caesura - 2 freq 'chaser' - 4 freq chaucer - 4 freq ceegar - 1 freq €˜ceegar - 1 freq cuikery - 1 freq co-cairry - 1 freq cougar - 1 freq chakra - 1 freq cowzer - 1 freq chekker - 1 freq |
MetaPhone code - XSR choisir - 1 freq chaser - 9 freq 'chaser' - 4 freq chaucer - 4 freq |
CHASER |
| Time to execute Levenshtein function - 0.207867 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.324464 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.027865 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.038602 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.000918 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. |