| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| recurrin (0) - 2 freq recurring (1) - 1 freq requirin (2) - 1 freq reserrin (2) - 1 freq returnin (2) - 14 freq referrin (2) - 11 freq recordin (2) - 21 freq securin (2) - 1 freq recurrent (2) - 2 freq occurrin (2) - 1 freq curlin (3) - 17 freq refusin (3) - 16 freq regardin (3) - 2 freq hectorin (3) - 1 freq ecrin (3) - 1 freq herrin (3) - 24 freq returning (3) - 9 freq recoverin (3) - 7 freq reducin (3) - 3 freq purrin (3) - 20 freq recyclin (3) - 1 freq resultin (3) - 7 freq recur (3) - 1 freq reukin (3) - 1 freq preferrin (3) - 5 freq |
recurrin (0) - 2 freq recurring (2) - 1 freq recurrent (3) - 2 freq referrin (3) - 11 freq occurrin (3) - 1 freq recordin (3) - 21 freq reserrin (3) - 1 freq acurren (4) - 1 freq recoverin (4) - 7 freq scurryin (4) - 7 freq scurrian (4) - 1 freq recruitin (4) - 1 freq curran (4) - 2 freq scarrin (4) - 1 freq securin (4) - 1 freq recordan (4) - 1 freq returnin (4) - 14 freq requirin (4) - 1 freq serrin (5) - 5 freq recedin (5) - 4 freq errin (5) - 1 freq uncurlin (5) - 1 freq reportin (5) - 15 freq blurrin (5) - 1 freq recordit (5) - 27 freq |
SoundEx code - R265 reassurance - 5 freq reassuringly - 2 freq reassurin - 7 freq requirement - 7 freq re-occurrin - 1 freq requirements - 14 freq recriminations - 1 freq reserrin - 1 freq recurrent - 2 freq recurrin - 2 freq requiring - 2 freq reassuran - 1 freq €˜rogerin - 1 freq re-assurance - 1 freq ragoran - 6 freq €œragoran - 1 freq reassuring - 2 freq recurring - 1 freq requirin - 1 freq rwgerruhmw - 1 freq rosgrams - 1 freq rogermiles - 1 freq rczrim - 1 freq requiremint - 1 freq |
MetaPhone code - RKRN recurrin - 2 freq ragoran - 6 freq €œragoran - 1 freq requirin - 1 freq |
RECURRIN |
| Time to execute Levenshtein function - 0.224551 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.391860 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.032572 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.043087 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.000984 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. |