We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
DSL查询之复合查询详解dis_max分数计算中给出的计算公式:分数 = 第一个匹配条件分数 + tie_breaker * 第二个匹配的条件的分数 ...不太合适,tie_breaker = 0且第二个匹配的条件的分数 > 第一个匹配条件分数时不正确,公式修改为:score=max(score1, score2, ....)+tie_breaker×(sum of other scores)合适一点
The text was updated successfully, but these errors were encountered:
No branches or pull requests
DSL查询之复合查询详解dis_max分数计算中给出的计算公式:分数 = 第一个匹配条件分数 + tie_breaker * 第二个匹配的条件的分数 ...不太合适,tie_breaker = 0且第二个匹配的条件的分数 > 第一个匹配条件分数时不正确,公式修改为:score=max(score1, score2, ....)+tie_breaker×(sum of other scores)合适一点
The text was updated successfully, but these errors were encountered: