| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| remembered (0) - 24 freq remember'd (1) - 1 freq rememmered (1) - 1 freq remembert (2) - 10 freq rememberin (2) - 4 freq remember (2) - 191 freq remembers (2) - 10 freq rememberins (3) - 1 freq 'remember' (3) - 2 freq rememmer (3) - 1 freq resembled (3) - 6 freq remembering (3) - 6 freq remembir (3) - 1 freq re-emerged (3) - 2 freq hemmered (3) - 4 freq ramember (3) - 2 freq members (4) - 67 freq redeemed (4) - 5 freq reverberated (4) - 2 freq timbered (4) - 1 freq registered (4) - 16 freq lumbered (4) - 1 freq requered (4) - 1 freq rendered (4) - 5 freq yammered (4) - 8 freq |
remembered (0) - 24 freq rememmered (2) - 1 freq remember'd (2) - 1 freq remembers (3) - 10 freq remember (3) - 191 freq rememberin (3) - 4 freq remembert (3) - 10 freq ramember (4) - 2 freq remembir (4) - 1 freq hemmered (5) - 4 freq remembering (5) - 6 freq rememberins (5) - 1 freq rememmer (5) - 1 freq 'remember' (5) - 2 freq resembled (5) - 6 freq encumbered (6) - 1 freq timmered (6) - 1 freq hammered (6) - 13 freq membert (6) - 3 freq numbered (6) - 6 freq member (6) - 75 freq hummered (6) - 1 freq clambered (6) - 3 freq reimbursed (6) - 1 freq rummeled (6) - 2 freq |
SoundEx code - R551 remembers - 10 freq remember - 191 freq remembert - 10 freq rememberin - 4 freq remembering - 6 freq remembered - 24 freq rememberins - 1 freq 'remember' - 2 freq remembrance - 14 freq remember'd - 1 freq romanoff - 1 freq remembir - 1 freq remembraunce - 4 freq €™remember - 1 freq rhiannonv - 1 freq ramember - 2 freq 'remembrance - 1 freq |
MetaPhone code - RMMRT remembert - 10 freq remembered - 24 freq remember'd - 1 freq rememmered - 1 freq |
REMEMBERED |
| Time to execute Levenshtein function - 0.188226 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.340262 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.027147 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.037186 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.000929 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. |