eUgEntOptIc44/MarginaliaSearch
1
1
Fork 0
mirror of https://github.com/MarginaliaSearch/MarginaliaSearch.git synced 2025-10-05 21:22:39 +02:00
Code Issues Activity

(index) Put back Chesterton's fence

Browse Source
This commit is contained in:
Viktor Lofgren
2025-09-24 16:09:54 +02:00
parent be83726427
commit 48791f56bd
1 changed files with 23 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
code/index/java/nu/marginalia/index/results/IndexResultRankingService.java
View File

@@ -677,12 +677,33 @@ public class IndexResultRankingService {
public VerbatimMatches(IntList[] positions, PhraseConstraintGroupList constraints, DocumentSpans spans) {
matches = new BitSet(HtmlTag.includedTags.length);
PhraseConstraintGroupList.PhraseConstraintGroup fullGroup = constraints.getFullGroup();
IntList fullGroupIntersections = fullGroup.findIntersections(positions);
if (fullGroup.size == 1) {
var titleSpan = spans.getSpan(HtmlTag.TITLE);
if (titleSpan.length() == fullGroup.size
&& titleSpan.containsRange(fullGroupIntersections, fullGroup.size))
{
score += 4; // If the title is a single word and the same as the query, we give it a verbatim bonus
}
var extLinkSpan = spans.getSpan(HtmlTag.EXTERNAL_LINKTEXT);
if (extLinkSpan.length() >= fullGroup.size) {
int cnt = extLinkSpan.containsRangeExact(fullGroupIntersections, fullGroup.size);
if (cnt > 0) {
score += 2 * cnt;
}
}
return;
}
/**
* FULL GROUP MATCHING
*/
PhraseConstraintGroupList.PhraseConstraintGroup fullGroup = constraints.getFullGroup();
IntList fullGroupIntersections = fullGroup.findIntersections(positions);
if (!fullGroupIntersections.isEmpty()) {
int totalFullCnts = 0;