Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
romanoff (0) - 1 freq runoff (3) - 1 freq roman (3) - 76 freq romanies (3) - 1 freq romancin (3) - 1 freq anoff (3) - 6 freq romansch (3) - 4 freq stroganoff (3) - 1 freq romantic (3) - 42 freq romans (3) - 44 freq romance (3) - 39 freq rosscoff (3) - 1 freq romania (3) - 1 freq romances (3) - 2 freq roumans (4) - 2 freq comatose (4) - 1 freq womans (4) - 5 freq domino's (4) - 2 freq enoff (4) - 1 freq woman (4) - 100 freq rowan (4) - 18 freq roma (4) - 1 freq domino (4) - 10 freq rorang (4) - 1 freq oaff (4) - 110 freq |
romanoff (0) - 1 freq runoff (4) - 1 freq romans (5) - 44 freq romania (5) - 1 freq romances (5) - 2 freq romantic (5) - 42 freq romance (5) - 39 freq roman (5) - 76 freq romancin (5) - 1 freq romanies (5) - 1 freq anoff (5) - 6 freq banff (6) - 45 freq remaned (6) - 1 freq romunce (6) - 5 freq remanded (6) - 1 freq anuff (6) - 28 freq smimoff (6) - 1 freq remand (6) - 2 freq rouman (6) - 2 freq remant (6) - 1 freq romauncin (6) - 1 freq romaniera (6) - 1 freq roumans (6) - 2 freq rosscoff (6) - 1 freq stroganoff (6) - 1 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 - RMNF romanoff - 1 freq |
ROMANOFF |
Time to execute Levenshtein function - 0.223017 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.402463 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.028934 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.041919 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.000957 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. |