| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| remember (0) - 191 freq remembers (1) - 10 freq remembir (1) - 1 freq remembert (1) - 10 freq rememmer (1) - 1 freq ramember (1) - 2 freq remember'd (2) - 1 freq dezember (2) - 4 freq rememberin (2) - 4 freq remembered (2) - 24 freq €™remember (2) - 1 freq €˜member (2) - 2 freq 'remember' (2) - 2 freq december (2) - 56 freq member (2) - 75 freq september (3) - 126 freq beemer (3) - 2 freq receiver (3) - 4 freq reeder (3) - 3 freq november (3) - 86 freq gemmer (3) - 1 freq reminder (3) - 19 freq decembir (3) - 2 freq dizember (3) - 2 freq rememberins (3) - 1 freq |
remember (0) - 191 freq remembir (1) - 1 freq ramember (1) - 2 freq remembert (2) - 10 freq remembers (2) - 10 freq rememmer (2) - 1 freq remembered (3) - 24 freq rememberin (3) - 4 freq member (3) - 75 freq december (4) - 56 freq €˜member (4) - 2 freq 'remember' (4) - 2 freq dezember (4) - 4 freq remember'd (4) - 1 freq €™remember (4) - 1 freq disremember (5) - 2 freq rememmered (5) - 1 freq remover (5) - 3 freq memmer (5) - 35 freq bremmer (5) - 1 freq resemble (5) - 3 freq maimber (5) - 14 freq membert (5) - 3 freq remembering (5) - 6 freq members (5) - 67 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 |
REMEMBER |
| Time to execute Levenshtein function - 0.311797 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.563559 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.030120 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.071481 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.000914 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. |