Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
remembraunce (0) - 4 freq remembrance (1) - 14 freq 'remembrance (2) - 1 freq resemblance (3) - 6 freq membrane (4) - 3 freq resemblances (4) - 2 freq rembrancer (4) - 1 freq resemblence (4) - 1 freq remberance (4) - 1 freq reverence (5) - 10 freq relevance (5) - 5 freq recompance (5) - 2 freq remembering (5) - 6 freq rememberins (5) - 1 freq revengance (5) - 1 freq emergence (5) - 4 freq rememberin (5) - 4 freq repentance (5) - 3 freq temperance (5) - 5 freq reference (5) - 52 freq revengeance (5) - 2 freq remonstrance (5) - 1 freq reassurance (5) - 5 freq embrace (5) - 19 freq reuerence (5) - 1 freq |
remembraunce (0) - 4 freq remembrance (1) - 14 freq 'remembrance (3) - 1 freq remberance (5) - 1 freq resemblance (5) - 6 freq membrane (6) - 3 freq remembering (6) - 6 freq rememberins (6) - 1 freq rememberin (6) - 4 freq resemblence (6) - 1 freq rembrancer (6) - 1 freq resemblances (7) - 2 freq semblance (8) - 3 freq reuerence (8) - 1 freq remembir (8) - 1 freq embrace (8) - 19 freq rembrandt (8) - 4 freq remember (8) - 191 freq remember'd (8) - 1 freq reassurance (8) - 5 freq remembert (8) - 10 freq remembers (8) - 10 freq reference (8) - 52 freq remembered (8) - 24 freq temperance (8) - 5 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 - RMMRNS rememberins - 1 freq remembrance - 14 freq remembraunce - 4 freq 'remembrance - 1 freq |
REMEMBRAUNCE |
Time to execute Levenshtein function - 0.220611 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.433948 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.027389 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.047499 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.001123 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. |