| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| remembert (0) - 10 freq remembers (1) - 10 freq remember (1) - 191 freq rememmer (2) - 1 freq ramember (2) - 2 freq rememberin (2) - 4 freq remembered (2) - 24 freq remember'd (2) - 1 freq remembir (2) - 1 freq membert (2) - 3 freq 'remember' (2) - 2 freq rememmered (3) - 1 freq remeent (3) - 2 freq member (3) - 75 freq €˜member (3) - 2 freq €™remember (3) - 1 freq recumbent (3) - 2 freq december (3) - 56 freq members (3) - 67 freq hemmert (3) - 4 freq rememberins (3) - 1 freq remembering (3) - 6 freq dezember (3) - 4 freq emerent (4) - 1 freq embers (4) - 8 freq |
remembert (0) - 10 freq remember (2) - 191 freq remembers (2) - 10 freq remembir (3) - 1 freq remembered (3) - 24 freq ramember (3) - 2 freq rememberin (3) - 4 freq membert (3) - 3 freq 'remember' (4) - 2 freq remember'd (4) - 1 freq rememmer (4) - 1 freq members (5) - 67 freq hemmert (5) - 4 freq remembering (5) - 6 freq recumbent (5) - 2 freq rememberins (5) - 1 freq rememmered (5) - 1 freq member (5) - 75 freq rummlet (6) - 1 freq rammelt (6) - 1 freq rummelt (6) - 7 freq nummert (6) - 4 freq clambert (6) - 2 freq lumbert (6) - 7 freq rubbert (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 |
REMEMBERT |
| Time to execute Levenshtein function - 0.196699 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.364745 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.028765 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.038168 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.000931 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. |