| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rememmered (0) - 1 freq remembered (1) - 24 freq remember'd (2) - 1 freq rememmer (2) - 1 freq remembert (3) - 10 freq hemmered (3) - 4 freq re-emerged (3) - 2 freq remember (3) - 191 freq remembers (3) - 10 freq rememberin (3) - 4 freq ramember (4) - 2 freq resembled (4) - 6 freq memmer (4) - 35 freq €˜memmers (4) - 1 freq 'remember' (4) - 2 freq €˜memmer (4) - 1 freq remembering (4) - 6 freq glimmered (4) - 5 freq hummered (4) - 1 freq resemmle (4) - 2 freq sclimmered (4) - 1 freq skimmered (4) - 2 freq rendered (4) - 5 freq revered (4) - 3 freq reteired (4) - 3 freq |
rememmered (0) - 1 freq remembered (2) - 24 freq rememmer (3) - 1 freq remember'd (4) - 1 freq rememberin (5) - 4 freq remember (5) - 191 freq remembers (5) - 10 freq hemmered (5) - 4 freq remembert (5) - 10 freq skimmered (6) - 2 freq murmered (6) - 1 freq rummeled (6) - 2 freq timmered (6) - 1 freq stammered (6) - 4 freq memmers (6) - 41 freq haimmered (6) - 4 freq hummered (6) - 1 freq recommend (6) - 25 freq yammered (6) - 8 freq ramember (6) - 2 freq re-emerged (6) - 2 freq memmer (6) - 35 freq shimmered (6) - 2 freq remembir (6) - 1 freq hammered (6) - 13 freq |
SoundEx code - R556 rememmer - 1 freq rememmered - 1 freq romaniera - 1 freq |
MetaPhone code - RMMRT remembert - 10 freq remembered - 24 freq remember'd - 1 freq rememmered - 1 freq |
REMEMMERED |
| Time to execute Levenshtein function - 0.226442 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.395075 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.028033 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.037922 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.000970 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. |