|
|
2099991dd1
|
Continue documenting and cleaning up the code
|
2023-03-20 09:41:56 +01:00 |
|
|
|
c232cdabf5
|
Add documentation
|
2023-03-20 09:41:56 +01:00 |
|
|
|
57fa689131
|
Cargo fmt
|
2023-03-20 09:41:56 +01:00 |
|
|
|
10626dddfc
|
Add a few more optimisations to new search algorithms
|
2023-03-20 09:41:56 +01:00 |
|
|
|
9051065c22
|
Apply a few optimisations for graph-based ranking rules
|
2023-03-20 09:41:56 +01:00 |
|
|
|
e8c76cf7bf
|
Intern all strings and phrases in the search logic
|
2023-03-20 09:41:56 +01:00 |
|
|
|
cab2b6bcda
|
Fix: computation of initial universe, code organisation
|
2023-03-20 09:41:56 +01:00 |
|
|
|
c4979a2fda
|
Fix code visibility issue + unimplemented detail in proximity rule
|
2023-03-20 09:41:56 +01:00 |
|
|
|
aa414565bb
|
Fix proximity graph edge builder to include all proximities
|
2023-03-20 09:41:56 +01:00 |
|
|
|
c27ea2677f
|
Rewrite cheapest path algorithm and empty path cache
It is now much simpler and has much better performance.
|
2023-03-20 09:41:56 +01:00 |
|
|
|
caa1e1b923
|
Add typo ranking rule to new search impl
|
2023-03-20 09:41:56 +01:00 |
|
|
|
600e3dd1c5
|
Remove warnings
|
2023-03-20 09:41:56 +01:00 |
|
|
|
6c85c0d95e
|
Fix more bugs + visual empty path cache logging
|
2023-03-20 09:41:56 +01:00 |
|
|
|
0e1fbbf7c6
|
Fix bugs in query graph's "remove word" and "cheapest paths" algos
|
2023-03-20 09:41:56 +01:00 |
|
|
|
173e37584c
|
Improve the visual/detailed search logger
|
2023-03-20 09:41:55 +01:00 |
|
|
|
dd12d44134
|
Support swapped word pairs in new proximity ranking rule impl
|
2023-03-20 09:41:55 +01:00 |
|
|
|
c8e251bf24
|
Remove noise in codebase
|
2023-03-20 09:41:55 +01:00 |
|
|
|
dcf3f1d18a
|
Remove EdgeIndex and NodeIndex types, prefer u32 instead
|
2023-03-20 09:41:55 +01:00 |
|
|
|
66d0c63694
|
Add some documentation and use bitmaps instead of hashmaps when possible
|
2023-03-20 09:41:55 +01:00 |
|
|
|
89d696c1e3
|
Introduce the proximity ranking rule as a graph-based ranking rule
|
2023-03-20 09:41:55 +01:00 |
|
|
|
a70ab8b072
|
Introduce a function to find the K shortest paths in a graph
|
2023-03-20 09:41:55 +01:00 |
|
|
|
48aae76b15
|
Introduce a function to find the docids of a set of paths in a graph
|
2023-03-20 09:41:55 +01:00 |
|
|
|
23bf572dea
|
Introduce cache structures used with ranking rule graphs
|
2023-03-20 09:41:55 +01:00 |
|
|
|
864f6410ed
|
Introduce a structure to represent a set of graph paths efficiently
|
2023-03-20 09:41:55 +01:00 |
|
|
|
c9bf6bb2fa
|
Introduce a structure to implement ranking rules with graph algorithms
|
2023-03-20 09:41:55 +01:00 |
|
