| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cubismo (0) - 1 freq cristo (3) - 1 freq cuisin (3) - 1 freq cuist (3) - 14 freq jubish (3) - 2 freq cubical (3) - 2 freq cubits (3) - 2 freq cubic (3) - 1 freq autism (3) - 3 freq cubicle (3) - 8 freq ubmo (3) - 1 freq cubs (3) - 7 freq chrisma (3) - 1 freq bisto (3) - 1 freq kubis (3) - 3 freq cubes (3) - 7 freq uiss (4) - 130 freq chirms (4) - 2 freq cruisin (4) - 11 freq cus (4) - 130 freq club's (4) - 5 freq cuifs (4) - 1 freq cuik (4) - 4 freq christa (4) - 1 freq chaist (4) - 3 freq |
cubismo (0) - 1 freq cubes (4) - 7 freq cubs (4) - 7 freq cbm (5) - 2 freq cristo (5) - 1 freq basm (5) - 1 freq cabesy (5) - 5 freq chasm (5) - 2 freq cobs (5) - 1 freq bisom (5) - 5 freq besm (5) - 1 freq cbus (5) - 1 freq bisto (5) - 1 freq kubis (5) - 3 freq cubical (5) - 2 freq cubits (5) - 2 freq jubish (5) - 2 freq cuist (5) - 14 freq cuisin (5) - 1 freq chrisma (5) - 1 freq cubic (5) - 1 freq ubmo (5) - 1 freq cubicle (5) - 8 freq autism (5) - 3 freq gubs (6) - 1 freq |
SoundEx code - C125 cappuccino - 10 freq cauf-kintra - 2 freq cappuccinae - 1 freq cubismo - 1 freq cpwgntgr - 1 freq cfconnolly - 1 freq cvjsmmgt - 1 freq cfjmmkkpxa - 1 freq cfcmod - 1 freq |
MetaPhone code - KBSM cubismo - 1 freq |
CUBISMO |
| Time to execute Levenshtein function - 0.235555 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.394049 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.028244 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.041516 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.000934 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. |