Mirror/MarginaliaSearch
1
0
Fork 0
mirror of https://github.com/MarginaliaSearch/MarginaliaSearch.git synced 2025-02-23 21:18:58 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

(index) Further ranking adjustments

Browse Source
This commit is contained in:
Viktor Lofgren 2024-01-01 18:43:17 +01:00
parent 8f522470ed
commit 50771045d0
1 changed files with 8 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
code/features-index/result-ranking/src/main/java/nu/marginalia/ranking/ResultValuator.java
View File

@ -109,7 +109,12 @@ public class ResultValuator {
} }
return normalize(2* bestTcf + bestBM25F + bestBM25P + bestBM25PN * 0.5) - overallPart / 4; double overallPartPositive = Math.max(0, overallPart);
double overallPartNegative = Math.min(0, overallPart);
// Renormalize to 0...15, where 0 is the best possible score;
// this is a historical artifact of the original ranking function
return normalize(1.5 * bestTcf + bestBM25F + bestBM25P + 0.25 * bestBM25PN + overallPartPositive, overallPartNegative);
} }
private double calculateQualityPenalty(int size, int quality, ResultRankingParameters rankingParams) { private double calculateQualityPenalty(int size, int quality, ResultRankingParameters rankingParams) {
@ -210,11 +215,11 @@ public class ResultValuator {
return 1 + maxSet; return 1 + maxSet;
} }
public static double normalize(double value) { public static double normalize(double value, double penalty) {
if (value < 0) if (value < 0)
value = 0; value = 0;
return Math.sqrt((1.0 + scalingFactor) / (1.0 + value)); return Math.sqrt((1.0 + scalingFactor) / (1.0 + value)) + Math.sqrt(penalty);
} }
} }