| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cataract (0) - 5 freq cataracts (1) - 1 freq cataran (2) - 1 freq attract (2) - 7 freq charact (2) - 1 freq atrack (3) - 1 freq catalans (3) - 3 freq carrant (3) - 2 freq extract (3) - 14 freq catalan (3) - 24 freq carapace (3) - 1 freq cabrach (3) - 24 freq detract (3) - 2 freq cateran (3) - 3 freq contract (3) - 26 freq cathcart (3) - 4 freq cabaret (3) - 2 freq catalyst (3) - 8 freq catapult (3) - 1 freq caramac (3) - 1 freq laarant (3) - 1 freq startct (3) - 1 freq caracts (3) - 1 freq cattrick (3) - 1 freq conract (3) - 1 freq |
cataract (0) - 5 freq cataracts (2) - 1 freq charact (3) - 1 freq attract (3) - 7 freq detract (4) - 2 freq contract (4) - 26 freq interact (4) - 9 freq tract (4) - 1 freq conract (4) - 1 freq extract (4) - 14 freq cataran (4) - 1 freq cabrach (5) - 24 freq caterans (5) - 5 freq atrack (5) - 1 freq attrac (5) - 1 freq attrack (5) - 4 freq attracts (5) - 2 freq astrict (5) - 3 freq strict (5) - 16 freq correct (5) - 40 freq citric (5) - 2 freq cattrick (5) - 1 freq carat (5) - 1 freq cabaret (5) - 2 freq cathcart (5) - 4 freq |
SoundEx code - C362 cattrick - 1 freq chitters - 7 freq catharsis - 1 freq cottaries - 1 freq citris - 3 freq citrus - 1 freq cedars - 1 freq cottars - 19 freq citrusy - 1 freq cottar-hooses - 1 freq catter's - 1 freq cutter's - 1 freq cheeters - 1 freq cataracts - 1 freq cataract - 5 freq cottars' - 3 freq cottar's - 1 freq cottar-hoose - 5 freq citric - 2 freq cheaters - 1 freq cathersmcg - 5 freq cheddars - 1 freq |
MetaPhone code - KTRKT cataract - 5 freq |
CATARACT |
| Time to execute Levenshtein function - 0.217050 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.363061 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.027420 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.044801 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.001278 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. |