giles
db2a5dc6ab
Some checks failed
Test, Build, and Deploy / test-build-deploy (push) Failing after 40s
searchRankTfIdf/searchRankBm25 parse a boolean query, filter docs via evalQuery, then rank survivors by relevance over the query's leaf terms (queryTerms) — the filter-then-rank pattern. 225/225. Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com>
43 lines
1.2 KiB
Plaintext
43 lines
1.2 KiB
Plaintext
;; search public API — assembles the canonical Haskell source from all layers.
|
|
;; Tests and callers concatenate `search/src` with their own top-level bindings
|
|
;; (e.g. "result = lookupTerm \"cat\" idx\n") and evaluate via the haskell-on-sx
|
|
;; interpreter. Public Haskell entry points: indexDoc, lookupTerm, deleteDoc,
|
|
;; docFreq, allTerms, tokens, positioned, evalQuery, parseQuery, searchQuery,
|
|
;; rankTfIdf, rankBm25, topNTfIdf, topNBm25, fedIndex, aclFilter, searchTfIdfAcl,
|
|
;; topNTfIdfAcl, searchBm25Acl, prefixTerms, prefixDocs, prefixRankTfIdf,
|
|
;; paginate, pageTfIdf, pageBm25, resultCount, editDist, fuzzyTerms, fuzzyDocs,
|
|
;; fuzzyRankTfIdf, highlight, snippet, stem, stemText, stemTokens, indexStemmed,
|
|
;; nearDocs, expandTerm, synDocs, synRankTfIdf, queryTerms, searchRankTfIdf,
|
|
;; searchRankBm25.
|
|
|
|
(define
|
|
search/src
|
|
(str
|
|
search/tokenize-src
|
|
"\n"
|
|
search/index-src
|
|
"\n"
|
|
search/query-src
|
|
"\n"
|
|
search/parse-src
|
|
"\n"
|
|
search/rank-src
|
|
"\n"
|
|
search/fed-src
|
|
"\n"
|
|
search/prefix-src
|
|
"\n"
|
|
search/page-src
|
|
"\n"
|
|
search/fuzzy-src
|
|
"\n"
|
|
search/highlight-src
|
|
"\n"
|
|
search/stem-src
|
|
"\n"
|
|
search/near-src
|
|
"\n"
|
|
search/syn-src
|
|
"\n"
|
|
search/rankq-src))
|