| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ramember (0) - 2 freq remember (1) - 191 freq remembir (2) - 1 freq rememmer (2) - 1 freq remembert (2) - 10 freq €˜member (2) - 2 freq member (2) - 75 freq remembers (2) - 10 freq rememberin (3) - 4 freq raether (3) - 1 freq rammies (3) - 4 freq amber (3) - 13 freq dizember (3) - 2 freq maimber (3) - 14 freq naemer (3) - 3 freq rammed (3) - 9 freq hammer (3) - 44 freq rademe (3) - 2 freq brammer (3) - 7 freq membert (3) - 3 freq ameter (3) - 1 freq dammer (3) - 1 freq bamber (3) - 2 freq november (3) - 86 freq 'remember' (3) - 2 freq |
ramember (0) - 2 freq remember (1) - 191 freq remembir (2) - 1 freq remembers (3) - 10 freq member (3) - 75 freq rememmer (3) - 1 freq remembert (3) - 10 freq maimber (4) - 14 freq remembered (4) - 24 freq €˜member (4) - 2 freq rememberin (4) - 4 freq memmer (5) - 35 freq rammle (5) - 3 freq december (5) - 56 freq camber (5) - 1 freq remember'd (5) - 1 freq members (5) - 67 freq €™remember (5) - 1 freq rammie (5) - 9 freq grammer (5) - 3 freq yammer (5) - 5 freq rammel (5) - 1 freq 'remember' (5) - 2 freq dezember (5) - 4 freq lammer (5) - 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 - RMMR remember - 191 freq 'remember' - 2 freq rememmer - 1 freq remembir - 1 freq €™remember - 1 freq ramember - 2 freq |
RAMEMBER |
| Time to execute Levenshtein function - 1.130306 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 - 1.186903 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.082476 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.037876 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.059955 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. |