| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| remembrance (0) - 14 freq 'remembrance (1) - 1 freq remembraunce (1) - 4 freq resemblance (2) - 6 freq remberance (3) - 1 freq rembrancer (3) - 1 freq resemblances (3) - 2 freq membrane (3) - 3 freq resemblence (3) - 1 freq relevance (4) - 5 freq semblance (4) - 3 freq embrace (4) - 19 freq rememberins (4) - 1 freq reference (4) - 53 freq repentance (4) - 3 freq recompance (4) - 2 freq reuerence (4) - 1 freq revengeance (4) - 2 freq remembering (4) - 6 freq reassurance (4) - 5 freq reverence (4) - 10 freq rememberin (4) - 4 freq remonstrance (4) - 1 freq rembrandt (4) - 4 freq revengance (4) - 1 freq |
remembrance (0) - 14 freq remembraunce (1) - 4 freq 'remembrance (2) - 1 freq remberance (4) - 1 freq resemblance (4) - 6 freq rememberin (5) - 4 freq resemblence (5) - 1 freq remembering (5) - 6 freq rembrancer (5) - 1 freq rememberins (5) - 1 freq membrane (5) - 3 freq resemblances (6) - 2 freq rembrandt (7) - 4 freq remonstrance (7) - 1 freq remember'd (7) - 1 freq reverence (7) - 10 freq remembers (7) - 10 freq remembered (7) - 23 freq remembert (7) - 10 freq temperance (7) - 5 freq remember (7) - 187 freq reassurance (7) - 5 freq embrace (7) - 19 freq semblance (7) - 3 freq reference (7) - 53 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 - RMMRNS rememberins - 1 freq remembrance - 14 freq remembraunce - 4 freq 'remembrance - 1 freq |
REMEMBRANCE |
| Time to execute Levenshtein function - 0.490327 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.589525 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.070160 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.039224 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.000845 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. |