Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
remembering (0) - 6 freq rememberins (1) - 1 freq rememberin (1) - 4 freq resembling (3) - 1 freq re-entering (3) - 1 freq remembers (3) - 10 freq remember (3) - 187 freq remembert (3) - 10 freq remembered (3) - 23 freq remember'd (3) - 1 freq slaebbering (4) - 1 freq rememmer (4) - 1 freq recovering (4) - 2 freq rememmered (4) - 1 freq yammering (4) - 1 freq rendering (4) - 1 freq resemblin (4) - 6 freq referring (4) - 6 freq ramember (4) - 2 freq remembir (4) - 1 freq 'remember' (4) - 2 freq clambering (4) - 1 freq tempering (4) - 1 freq hemmerin (4) - 7 freq misrememberin (4) - 1 freq |
remembering (0) - 6 freq rememberin (2) - 4 freq rememberins (2) - 1 freq remember'd (5) - 1 freq remembrance (5) - 14 freq remembert (5) - 10 freq remembered (5) - 23 freq resembling (5) - 1 freq remember (5) - 187 freq remembers (5) - 10 freq ramember (6) - 2 freq yammering (6) - 1 freq remembir (6) - 1 freq clambering (6) - 1 freq remembraunce (6) - 4 freq re-entering (6) - 1 freq rummelling (7) - 1 freq mumbling (7) - 1 freq rumbling (7) - 1 freq misrememberin (7) - 1 freq 'remembrance (7) - 1 freq rambling (7) - 3 freq remberance (7) - 1 freq hemmerin (7) - 7 freq rendering (7) - 1 freq |
SoundEx code - R551 remembers - 10 freq remember - 187 freq remembert - 10 freq rememberin - 4 freq remembering - 6 freq remembered - 23 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 - RMMRNK remembering - 6 freq |
REMEMBERING |
Time to execute Levenshtein function - 0.512202 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.196752 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.090859 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.104712 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.000829 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. |