| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rembrancer (0) - 1 freq remberance (2) - 1 freq semblance (3) - 3 freq embraced (3) - 7 freq rembrandt (3) - 4 freq membrane (3) - 3 freq embraces (3) - 1 freq embrace (3) - 19 freq remembrance (3) - 14 freq remainder (4) - 3 freq reliance (4) - 4 freq embroider (4) - 1 freq reminder (4) - 19 freq romances (4) - 2 freq romance (4) - 39 freq temperance (4) - 5 freq reverence (4) - 10 freq retrace (4) - 1 freq resemblance (4) - 6 freq embraked (4) - 1 freq reference (4) - 52 freq ramrace (4) - 1 freq remembraunce (4) - 4 freq brander (4) - 2 freq remaned (4) - 1 freq |
rembrancer (0) - 1 freq remberance (3) - 1 freq remembrance (5) - 14 freq rembrandt (5) - 4 freq remembraunce (6) - 4 freq embraces (6) - 1 freq embrace (6) - 19 freq semblance (6) - 3 freq embraced (6) - 7 freq membrane (6) - 3 freq rebrand (7) - 2 freq referenced (7) - 1 freq beirance (7) - 1 freq resemblances (7) - 2 freq brander (7) - 2 freq reuerence (7) - 1 freq robreiner (7) - 1 freq refrences (7) - 2 freq 'remembrance (7) - 1 freq prancer (7) - 2 freq references (7) - 41 freq embracin (7) - 7 freq romance (7) - 39 freq ramrace (7) - 1 freq romances (7) - 2 freq |
SoundEx code - R516 rampart - 2 freq rainforest - 5 freq rainforests - 1 freq reinforcements - 2 freq reinforce - 6 freq reinforcin - 2 freq reimbursed - 1 freq rembrandt - 4 freq rembrancer - 1 freq renfra - 10 freq renfrew - 8 freq renfrewshire - 6 freq renfra's - 1 freq remover - 3 freq room-fresh' - 1 freq reinforcement - 2 freq ramversit - 1 freq ramparts - 2 freq reinforced - 1 freq reinforces - 2 freq remberance - 1 freq ranforced - 1 freq rhiannaparade - 5 freq rampur - 1 freq |
MetaPhone code - RMRNSR rembrancer - 1 freq |
REMBRANCER |
| Time to execute Levenshtein function - 0.219915 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.440559 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.027570 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.037344 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.000884 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. |