3 ms·
My boolean logic is here: [1] I'm sure it has flaws. Since the index had only five or six entries a couple of hours ago I set the matching to be wide instead o
by misterman0 8y ago
My boolean logic is here: [1] I'm sure it has flaws.
Since the index had only five or six entries a couple of hours ago I set the matching to be wide instead of narrow. I'm also experimenting with loading the model with phrases, phrases and words or words only. I might have f-ed up the query parsing because of that. Remember, this is 0.1, fresh out of the press.
Searching the tree is here: [2]
Tokenization is here: [3]
[1] https://github.com/kreeben/resin/blob/master/src/Sir.Store/ReadSession.cs#L68 https://github.com/kreeben/resin/blob/master/src/Sir.Store/R...
[2] https://github.com/kreeben/resin/blob/master/src/Sir.Store/VectorNode.cs#L209 https://github.com/kreeben/resin/blob/master/src/Sir.Store/V...
[3] https://github.com/kreeben/resin/blob/master/src/Sir.Store/LatinTokenizer.cs#L24 https://github.com/kreeben/resin/blob/master/src/Sir.Store/L...
- deleted 8y ago[deleted]
- tlb 8y agoMajor search engines test every release against a list of search queries. You could start with https://trends.google.com/trends/topcharts https://trends.google.com/trends/topcharts. You should have an automated test script with a list of (query, good URL) pairs and make sure the good URL appears in the top few results.
- misterman0 8y agoAs preparation for this demo, yes I absolutely should have run such a test. Eagerness won. Thanks for the link.