Improve string matching algorithm

[nerzid]

Levenshtein and Jaccard doesn't work well with our recommendation system. For example; when we give input cur it recommends score or other words but we actually expect the outcome to be current.

Some of the rules I think of when abbreviating in programming;

• Always use the first letter in abbreviation which means do not dismiss it when abbreviating
• Phonetics matter
• There are abbreviations exist which dismiss all vowels(e.g. message -> msg) and also exist which doesn't dismiss vowels(e.g. preference -> pref).
• If there is a letter repetition as in "message" or "quantity", after removing vowels, it's almost everytime the excess letters are removed(e.g. "message -> msg , quantity, qty).

Types of abbreviations are;

• Use the first part of the word(e.g. preference -> pref)
• Use the first letters of multiple words(e.g. red green blue -> rgb)
• Remove all vowels except the first one(e.g. message -> msg. Still it doesn't mean that all non-vowels letters will stay. Like in the example, we kept only the one 's')
• Monosyllabic words(e.g. mount -> mt) I didn't decided it yet that this is being used in programming.

[nerzid]

Some of the links I find for string matching, I'll post them here.

• Wiki on String Matching
• Shift-And string matching algorithm and it's Visualization(Prefix first)
• On-line pattern matching on similar texts

[nerzid]

Some of the links I find for abbreviation and how to do it.

• Abbreviation Types
• 3 Tips for correct abbreviations