mirror of
https://github.com/CyC2018/Interview-Notebook.git
synced 2026-11-19 17:43:47 +00:00
@@ -94,6 +94,14 @@ const natural = { documents: [
|
||||
assert.equal(search(natural, '什么情况索引会失效?')[0].id, 'invalid', '整句的问法按词组的相关度找到小节');
|
||||
assert.equal(search(natural, '平时是怎么用协程的')[0].id, 'co', '问法中的“平时”“用”这类词不影响');
|
||||
assert.equal(search(natural, '主从复制')[0].id, 'repl', '短的搜索词仍按完整匹配排序');
|
||||
const versions = { documents: [{ title: 'HTTP', path: '/notes/HTTP', sections: [
|
||||
{ title: '八、HTTP/2.0', id: 'h2', text: '二进制分帧、多路复用、首部压缩' },
|
||||
{ title: '七、HTTP/1.1 新特性', id: 'h11', text: '默认长连接' },
|
||||
{ title: '一、基础概念', id: 'base', text: '请求和响应' },
|
||||
] }] };
|
||||
assert.equal(search(versions, 'HTTP2.0 有哪些优势?')[0].id, 'h2', '“HTTP2.0”按笔记中的写法“HTTP/2.0”搜');
|
||||
assert.equal(search(versions, 'http2')[0].id, 'h2');
|
||||
assert(search(versions, 'HTTP1.1、2.0 的区别').slice(0, 2).some(r => r.id === 'h11'), '顿号分开的版本号是两个词');
|
||||
const sample = { documents: [{ title: '数据库', path: '/notes/示例', sections: [
|
||||
{ title: '事务', id: '事务', text: '一致性 '.repeat(20) },
|
||||
{ title: '一致性', id: '一致性', text: 'SQL 与数据库' },
|
||||
|
||||
@@ -2,7 +2,8 @@
|
||||
'use strict';
|
||||
|
||||
function normalize(value) {
|
||||
return String(value).normalize('NFKC').toLowerCase().replace(/\s+/g, ' ').trim();
|
||||
// HTTP 的版本号统一成笔记中的写法:“HTTP2.0”“http 2”都按“http/2.0”“http/2”搜
|
||||
return String(value).normalize('NFKC').toLowerCase().replace(/\s+/g, ' ').trim().replace(/\bhttp ?\/? ?([123](?:\.\d)?)(?![\d.])/g, 'http/$1');
|
||||
}
|
||||
|
||||
var preparedIndexes = new WeakMap();
|
||||
@@ -153,15 +154,19 @@
|
||||
}
|
||||
|
||||
// 相关度:词组越少见越重要(IDF),出现在小节标题中权重最大
|
||||
var dfCache = new WeakMap();
|
||||
var dfCache = new WeakMap(), FUNCTION_CHARS = /[的是了吗呢么在和与及或也都就而吧啊呀这那你我他它们个些把被让给对从到会能要还]/;
|
||||
function relevance(entries, text) {
|
||||
var units = [];
|
||||
normalize(text.replace(QUESTION, ' ')).split(' ').forEach(function (word) {
|
||||
(word.match(/[㐀-鿿豈-]+|[^㐀-鿿豈-]+/g) || []).forEach(function (part) {
|
||||
if (CJK.test(part)) {
|
||||
for (var i = 0; i + 1 < part.length; i++) units.push([part.slice(i, i + 2)]);
|
||||
} else if (part.replace(/[^a-z0-9]/g, '').length >= 2) {
|
||||
units.push(alternatives(part));
|
||||
for (var i = 0; i + 1 < part.length; i++) if (!FUNCTION_CHARS.test(part.slice(i, i + 2))) units.push([part.slice(i, i + 2)]);
|
||||
} else {
|
||||
// 英文和数字按词切开,标点(“、”“,”)不算词的一部分:“http/1.0、2.0”是两个词
|
||||
(part.match(/[a-z0-9][a-z0-9+#./_-]*/g) || []).forEach(function (token) {
|
||||
token = token.replace(/[./_-]+$/, '');
|
||||
if (token.replace(/[^a-z0-9]/g, '').length >= 2) units.push(alternatives(token));
|
||||
});
|
||||
}
|
||||
});
|
||||
});
|
||||
@@ -252,7 +257,7 @@
|
||||
results.sort(function (a, b) { return b.score - a.score || a.penalty - b.penalty; });
|
||||
// 整句的问法(去掉问法后还有 7 个以上汉字,或 3 个以上的词)和相关度排序做倒数排名融合:两边都靠前的排在最前;
|
||||
// 短的搜索词保持原来的排序,相关度中的结果补在后面
|
||||
var core = stripped || normalizedQuery, rel = relevance(entries, core), fused = {}, K = 8;
|
||||
var core = stripped || normalizedQuery, rel = relevance(entries, core), fused = {}, K = 1;
|
||||
var sentence = (core.match(/[㐀-鿿豈-]/g) || []).length >= 7 || splitTerms(core).length >= 3;
|
||||
var exactWeight = sentence ? 1 : 100;
|
||||
results.forEach(function (r, i) { fused[r.path + '?' + r.id] = exactWeight / (K + i + 1); });
|
||||
|
||||
Reference in New Issue
Block a user