☰

string-overlap-matching-degree

计算字符串重叠/匹配度计算

此脚本不应直接安装，它是一个供其他脚本使用的外部库。如果您需要使用该库，请在脚本元属性加入：// @require https://update.gf.qytechs.cn/scripts/501646/1429885/string-overlap-matching-degree.js 

  1. /* 当前版本：v1.1 */
  2. /**
  3.  * 重叠匹配度
  4.  * @author: zhuangjie
  5.  * @date: 2024-07-23
  6.  */
  7. function overlapMatchingDegreeForObjectArray(keyword = "", objArr = [], fun = (obj) => [], {sort = "desc", onlyHasScope = false, scopeForObjArrContainer} = {}) {
  8.     const scopeForData = objArr.map(item => overlapMatchingDegree(keyword, fun(item), sort));
  9.     // scope与 objArr 同步排序
  10.     sortAndSync(scopeForData, objArr, sort);
  11.     
  12.     if (Array.isArray(scopeForObjArrContainer)) {
  13.         scopeForObjArrContainer.push(...scopeForData);
  14.     }
  15.  
  16.     return onlyHasScope ? objArr.filter((_, index) => scopeForData[index] !== 0) : objArr;
  17. }
  18. /**
  19.  * 计算匹配度外层封装工具
  20.  * @param {string} keyword - 匹配字符串1
  21.  * @param {Object | Arrayy} topicWeighs - 匹配字符串2与它的权重
  22.  * @returns {number} 匹配度分数
  23.  */
  24. function overlapMatchingDegree(keyword, topicWeighs = {}, sort = "desc") {
  25.     if (Array.isArray(topicWeighs)) {
  26.         const weightMultiplier = sort === "asc" ? 1 : -1;
  27.         topicWeighs = Object.fromEntries(topicWeighs.map((topic, index) => [topic, (index + 1) * weightMultiplier]));
  28.     }
  29.     
  30.     return Object.keys(topicWeighs).reduce((totalScore, topic) => {
  31.         const currentScore = topicWeighs[topic];
  32.         const overlapLengthBlocksMap = findOverlapBlocks(keyword, topic);
  33.         return totalScore + Object.entries(overlapLengthBlocksMap).reduce((sum, [length, blocks]) => {
  34.             return sum + blocks.length * Math.pow(currentScore, Number(length));
  35.         }, 0);
  36.     }, 0);
  37. }
  38. /**
  39.  * 查找重叠匹配块（入口函数）
  40.  * @param {*} str1 
  41.  * @param {*} str2 
  42.  * @returns 返回重叠块 如：{"2": ["好用","推荐"],"3": ["好用推荐"]}
  43.  * 算法核心思想：
  44.  * -----------------------------------------------------
  45.  * sumatrapdf*          | sumatrapdf*      | sumatrapdf*
  46.  *           pdf-       |          pdf-    |         pdf-
  47.  * ------------------------------------------------------
  48.  */
  49. function findOverlapBlocks(str1 = "", str2 = "") {
  50.     const alignmentHub = {};
  51.     const str1Len = str1.length;
  52.     const str2Len = str2.length;
  53.     const minLen = Math.min(str1Len, str2Len);
  54.  
  55.     for (let offset = 1 - str2Len; offset < str1Len; offset++) {
  56.         const start = Math.max(0, offset);
  57.         const end = Math.min(str1Len, str2Len + offset);
  58.         const overlapStr1 = str1.slice(start, end);
  59.         const overlapStr2 = str2.slice(start - offset, end - offset);
  60.  
  61.         const alignmentContent = alignment(overlapStr1, overlapStr2);
  62.         for (const [len, blocks] of Object.entries(alignmentContent)) {
  63.             alignmentHub[len] = alignmentHub[len] ? [...new Set([...alignmentHub[len], ...blocks])] : blocks;
  64.         }
  65.     }
  66.     return alignmentHub;
  67. }
  68. // 对齐
  69. function alignment(str1 = "", str2 = "") {
  70.     const overlappingBlocks = {};
  71.     let currentBlock = "";
  72.  
  73.     for (let i = str1.length - 1; i >= 0; i--) {
  74.         if (str1[i] === str2[i]) {
  75.             currentBlock = str1[i] + currentBlock;
  76.         } else if (currentBlock.length > 0) {
  77.             const len = currentBlock.length;
  78.             overlappingBlocks[len] = overlappingBlocks[len] || [];
  79.             if (!overlappingBlocks[len].includes(currentBlock)) {
  80.                 overlappingBlocks[len].push(currentBlock);
  81.             }
  82.             currentBlock = "";
  83.         }
  84.     }
  85.     if (currentBlock.length > 0) {
  86.         const len = currentBlock.length;
  87.         overlappingBlocks[len] = overlappingBlocks[len] || [];
  88.         if (!overlappingBlocks[len].includes(currentBlock)) {
  89.             overlappingBlocks[len].push(currentBlock);
  90.         }
  91.     }
  92.  
  93.     return overlappingBlocks;
  94. }
  95. // 【同步排序算法】
  96. function sortAndSync(arr1, arr2, order = 'desc') {
  97.     const compare = order === 'asc' ? (a, b) => a - b : (a, b) => b - a;
  98.     arr1.map((v, i) => [v, arr2[i]])
  99.         .sort((a, b) => compare(a[0], b[0]))
  100.         .forEach(([v, o], i) => {
  101.             arr1[i] = v;
  102.             arr2[i] = o;
  103.         });
  104. }
  105.  
  106.  
  107. // 【算法测试1】
  108. //  console.log("-- 算法测试开始 --")
  109. //  console.log(findOverlapBlocks("[推荐]sumatrapdf非常好用","pdf 推荐"))
  110. //  console.log("-- 算法测试结束 --")
  111.  
  112. // 【算法测试2】
  113. // console.log("匹配度：", overlapMatchingDegree("好用的pdf工具", { "sumatrapdf": 10, "小而好用的pdf阅读器": 8, "https://www.sumatrapdfreader.org/downloadafter": 3 }));

欢迎访问Greasy Fork镜像

土豆服务器，请按需使用

镜像地址随时可能被墙，建议加群获取最新地址

加入Q群

QingJ © 2025

镜像随时可能失效，请加Q群300939539或关注我们的公众号极客氢云获取最新地址