What it does is defer to a match implementation. "good-match" takes an object and returns a score.
So, far I am using fairly banal searchers that look for key words and compare distance from the front of the string to things like the length of the string. There is always tokenization and doing naive Bayes.
So, the descendants of the Searcher class in copious-little-searcher could turn into something of library.
This might be good to use.
Looks like good work.
I just put this out. https://www.npmjs.com/package/copious-little-searcher
What it does is defer to a match implementation. "good-match" takes an object and returns a score.
So, far I am using fairly banal searchers that look for key words and compare distance from the front of the string to things like the length of the string. There is always tokenization and doing naive Bayes.
So, the descendants of the Searcher class in copious-little-searcher could turn into something of library.