| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| redcurrant (0) - 1 freq redcurrent (1) - 1 freq recurrent (2) - 2 freq redundant (3) - 5 freq recurrin (3) - 2 freq currant (3) - 4 freq durrant (3) - 2 freq recurring (3) - 1 freq returnan (4) - 1 freq €œcurrent (4) - 1 freq recumbent (4) - 2 freq resurgent (4) - 1 freq eerrant (4) - 1 freq reluctant (4) - 14 freq earrant (4) - 1 freq courrant (4) - 1 freq kerrant (4) - 1 freq current (4) - 89 freq currans (4) - 1 freq currants (4) - 7 freq redcoat (4) - 2 freq carrant (4) - 2 freq restaurant (4) - 27 freq returnt (4) - 16 freq recordan (4) - 1 freq |
redcurrant (0) - 1 freq redcurrent (1) - 1 freq recurrent (3) - 2 freq durrant (5) - 2 freq recurring (5) - 1 freq recurrin (5) - 2 freq currant (5) - 4 freq courrant (6) - 1 freq current (6) - 89 freq €œcurrent (6) - 1 freq carrant (6) - 2 freq redundant (6) - 5 freq returnt (7) - 16 freq restaurant (7) - 27 freq recordan (7) - 1 freq reverant (7) - 3 freq resurrect (7) - 3 freq retuirnt (7) - 3 freq errant (7) - 2 freq deterrent (7) - 3 freq curran (7) - 2 freq reluctant (7) - 14 freq eerrant (7) - 1 freq redcoat (7) - 2 freq recumbent (7) - 2 freq |
SoundEx code - R326 rathgormack - 1 freq rid-craigit - 1 freq red-carpet - 1 freq rodgers - 2 freq ridseard - 1 freq ridgers - 3 freq redcurrant - 1 freq radiocarbon - 1 freq redgrass - 1 freq €œredgrave - 1 freq rodger - 4 freq red-green - 1 freq redcurrent - 1 freq redcard - 1 freq rodjgrimmer - 3 freq redsquirrelsuw - 3 freq redsquirrelsinw - 2 freq |
MetaPhone code - RTKRNT redcurrant - 1 freq redcurrent - 1 freq |
REDCURRANT |
| Time to execute Levenshtein function - 0.254239 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.400991 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.029682 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.044234 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.001005 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. |