您最多选择25个主题 主题必须以字母或数字开头,可以包含连字符 (-),并且长度不得超过35个字符

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262
  1. #
  2. # Copyright 2024 The InfiniFlow Authors. All Rights Reserved.
  3. #
  4. # Licensed under the Apache License, Version 2.0 (the "License");
  5. # you may not use this file except in compliance with the License.
  6. # You may obtain a copy of the License at
  7. #
  8. # http://www.apache.org/licenses/LICENSE-2.0
  9. #
  10. # Unless required by applicable law or agreed to in writing, software
  11. # distributed under the License is distributed on an "AS IS" BASIS,
  12. # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  13. # See the License for the specific language governing permissions and
  14. # limitations under the License.
  15. #
  16. import logging
  17. import json
  18. import re
  19. from collections import defaultdict
  20. from rag.utils.doc_store_conn import MatchTextExpr
  21. from rag.nlp import rag_tokenizer, term_weight, synonym
  22. class FulltextQueryer:
  23. def __init__(self):
  24. self.tw = term_weight.Dealer()
  25. self.syn = synonym.Dealer()
  26. self.query_fields = [
  27. "title_tks^10",
  28. "title_sm_tks^5",
  29. "important_kwd^30",
  30. "important_tks^20",
  31. "question_tks^20",
  32. "content_ltks^2",
  33. "content_sm_ltks",
  34. ]
  35. @staticmethod
  36. def subSpecialChar(line):
  37. return re.sub(r"([:\{\}/\[\]\-\*\"\(\)\|\+~\^])", r"\\\1", line).strip()
  38. @staticmethod
  39. def isChinese(line):
  40. arr = re.split(r"[ \t]+", line)
  41. if len(arr) <= 3:
  42. return True
  43. e = 0
  44. for t in arr:
  45. if not re.match(r"[a-zA-Z]+$", t):
  46. e += 1
  47. return e * 1.0 / len(arr) >= 0.7
  48. @staticmethod
  49. def rmWWW(txt):
  50. patts = [
  51. (
  52. r"是*(什么样的|哪家|一下|那家|请问|啥样|咋样了|什么时候|何时|何地|何人|是否|是不是|多少|哪里|怎么|哪儿|怎么样|如何|哪些|是啥|啥是|啊|吗|呢|吧|咋|什么|有没有|呀|谁|哪位|哪个)是*",
  53. "",
  54. ),
  55. (r"(^| )(what|who|how|which|where|why)('re|'s)? ", " "),
  56. (
  57. r"(^| )('s|'re|is|are|were|was|do|does|did|don't|doesn't|didn't|has|have|be|there|you|me|your|my|mine|just|please|may|i|should|would|wouldn't|will|won't|done|go|for|with|so|the|a|an|by|i'm|it's|he's|she's|they|they're|you're|as|by|on|in|at|up|out|down|of|to|or|and|if) ",
  58. " ")
  59. ]
  60. otxt = txt
  61. for r, p in patts:
  62. txt = re.sub(r, p, txt, flags=re.IGNORECASE)
  63. if not txt:
  64. txt = otxt
  65. return txt
  66. def question(self, txt, tbl="qa", min_match: float = 0.6):
  67. txt = re.sub(
  68. r"[ :|\r\n\t,,。??/`!!&^%%()\[\]{}<>]+",
  69. " ",
  70. rag_tokenizer.tradi2simp(rag_tokenizer.strQ2B(txt.lower())),
  71. ).strip()
  72. txt = FulltextQueryer.rmWWW(txt)
  73. if not self.isChinese(txt):
  74. txt = FulltextQueryer.rmWWW(txt)
  75. tks = rag_tokenizer.tokenize(txt).split()
  76. keywords = [t for t in tks if t]
  77. tks_w = self.tw.weights(tks, preprocess=False)
  78. tks_w = [(re.sub(r"[ \\\"'^]", "", tk), w) for tk, w in tks_w]
  79. tks_w = [(re.sub(r"^[a-z0-9]$", "", tk), w) for tk, w in tks_w if tk]
  80. tks_w = [(re.sub(r"^[\+-]", "", tk), w) for tk, w in tks_w if tk]
  81. tks_w = [(tk.strip(), w) for tk, w in tks_w if tk.strip()]
  82. syns = []
  83. for tk, w in tks_w[:256]:
  84. syn = self.syn.lookup(tk)
  85. syn = rag_tokenizer.tokenize(" ".join(syn)).split()
  86. keywords.extend(syn)
  87. syn = ["\"{}\"^{:.4f}".format(s, w / 4.) for s in syn if s.strip()]
  88. syns.append(" ".join(syn))
  89. q = ["({}^{:.4f}".format(tk, w) + " {})".format(syn) for (tk, w), syn in zip(tks_w, syns) if
  90. tk and not re.match(r"[.^+\(\)-]", tk)]
  91. for i in range(1, len(tks_w)):
  92. left, right = tks_w[i - 1][0].strip(), tks_w[i][0].strip()
  93. if not left or not right:
  94. continue
  95. q.append(
  96. '"%s %s"^%.4f'
  97. % (
  98. tks_w[i - 1][0],
  99. tks_w[i][0],
  100. max(tks_w[i - 1][1], tks_w[i][1]) * 2,
  101. )
  102. )
  103. if not q:
  104. q.append(txt)
  105. query = " ".join(q)
  106. return MatchTextExpr(
  107. self.query_fields, query, 100
  108. ), keywords
  109. def need_fine_grained_tokenize(tk):
  110. if len(tk) < 3:
  111. return False
  112. if re.match(r"[0-9a-z\.\+#_\*-]+$", tk):
  113. return False
  114. return True
  115. txt = FulltextQueryer.rmWWW(txt)
  116. qs, keywords = [], []
  117. for tt in self.tw.split(txt)[:256]: # .split():
  118. if not tt:
  119. continue
  120. keywords.append(tt)
  121. twts = self.tw.weights([tt])
  122. syns = self.syn.lookup(tt)
  123. if syns and len(keywords) < 32:
  124. keywords.extend(syns)
  125. logging.debug(json.dumps(twts, ensure_ascii=False))
  126. tms = []
  127. for tk, w in sorted(twts, key=lambda x: x[1] * -1):
  128. sm = (
  129. rag_tokenizer.fine_grained_tokenize(tk).split()
  130. if need_fine_grained_tokenize(tk)
  131. else []
  132. )
  133. sm = [
  134. re.sub(
  135. r"[ ,\./;'\[\]\\`~!@#$%\^&\*\(\)=\+_<>\?:\"\{\}\|,。;‘’【】、!¥……()——《》?:“”-]+",
  136. "",
  137. m,
  138. )
  139. for m in sm
  140. ]
  141. sm = [FulltextQueryer.subSpecialChar(m) for m in sm if len(m) > 1]
  142. sm = [m for m in sm if len(m) > 1]
  143. if len(keywords) < 32:
  144. keywords.append(re.sub(r"[ \\\"']+", "", tk))
  145. keywords.extend(sm)
  146. tk_syns = self.syn.lookup(tk)
  147. tk_syns = [FulltextQueryer.subSpecialChar(s) for s in tk_syns]
  148. if len(keywords) < 32:
  149. keywords.extend([s for s in tk_syns if s])
  150. tk_syns = [rag_tokenizer.fine_grained_tokenize(s) for s in tk_syns if s]
  151. tk_syns = [f"\"{s}\"" if s.find(" ") > 0 else s for s in tk_syns]
  152. if len(keywords) >= 32:
  153. break
  154. tk = FulltextQueryer.subSpecialChar(tk)
  155. if tk.find(" ") > 0:
  156. tk = '"%s"' % tk
  157. if tk_syns:
  158. tk = f"({tk} OR (%s)^0.2)" % " ".join(tk_syns)
  159. if sm:
  160. tk = f'{tk} OR "%s" OR ("%s"~2)^0.5' % (" ".join(sm), " ".join(sm))
  161. if tk.strip():
  162. tms.append((tk, w))
  163. tms = " ".join([f"({t})^{w}" for t, w in tms])
  164. if len(twts) > 1:
  165. tms += ' ("%s"~2)^1.5' % rag_tokenizer.tokenize(tt)
  166. syns = " OR ".join(
  167. [
  168. '"%s"'
  169. % rag_tokenizer.tokenize(FulltextQueryer.subSpecialChar(s))
  170. for s in syns
  171. ]
  172. )
  173. if syns and tms:
  174. tms = f"({tms})^5 OR ({syns})^0.7"
  175. qs.append(tms)
  176. if qs:
  177. query = " OR ".join([f"({t})" for t in qs if t])
  178. return MatchTextExpr(
  179. self.query_fields, query, 100, {"minimum_should_match": min_match}
  180. ), keywords
  181. return None, keywords
  182. def hybrid_similarity(self, avec, bvecs, atks, btkss, tkweight=0.3, vtweight=0.7):
  183. from sklearn.metrics.pairwise import cosine_similarity as CosineSimilarity
  184. import numpy as np
  185. sims = CosineSimilarity([avec], bvecs)
  186. tksim = self.token_similarity(atks, btkss)
  187. if np.sum(sims[0]) == 0:
  188. return np.array(tksim), tksim, sims[0]
  189. return np.array(sims[0]) * vtweight + np.array(tksim) * tkweight, tksim, sims[0]
  190. def token_similarity(self, atks, btkss):
  191. def toDict(tks):
  192. if isinstance(tks, str):
  193. tks = tks.split()
  194. d = defaultdict(int)
  195. wts = self.tw.weights(tks, preprocess=False)
  196. for i, (t, c) in enumerate(wts):
  197. d[t] += c
  198. return d
  199. atks = toDict(atks)
  200. btkss = [toDict(tks) for tks in btkss]
  201. return [self.similarity(atks, btks) for btks in btkss]
  202. def similarity(self, qtwt, dtwt):
  203. if isinstance(dtwt, type("")):
  204. dtwt = {t: w for t, w in self.tw.weights(self.tw.split(dtwt), preprocess=False)}
  205. if isinstance(qtwt, type("")):
  206. qtwt = {t: w for t, w in self.tw.weights(self.tw.split(qtwt), preprocess=False)}
  207. s = 1e-9
  208. for k, v in qtwt.items():
  209. if k in dtwt:
  210. s += v #* dtwt[k]
  211. q = 1e-9
  212. for k, v in qtwt.items():
  213. q += v #* v
  214. return s/q #math.sqrt(3. * (s / q / math.log10( len(dtwt.keys()) + 512 )))
  215. def paragraph(self, content_tks: str, keywords: list = [], keywords_topn=30):
  216. if isinstance(content_tks, str):
  217. content_tks = [c.strip() for c in content_tks.strip() if c.strip()]
  218. tks_w = self.tw.weights(content_tks, preprocess=False)
  219. keywords = [f'"{k.strip()}"' for k in keywords]
  220. for tk, w in sorted(tks_w, key=lambda x: x[1] * -1)[:keywords_topn]:
  221. tk_syns = self.syn.lookup(tk)
  222. tk_syns = [FulltextQueryer.subSpecialChar(s) for s in tk_syns]
  223. tk_syns = [rag_tokenizer.fine_grained_tokenize(s) for s in tk_syns if s]
  224. tk_syns = [f"\"{s}\"" if s.find(" ") > 0 else s for s in tk_syns]
  225. tk = FulltextQueryer.subSpecialChar(tk)
  226. if tk.find(" ") > 0:
  227. tk = '"%s"' % tk
  228. if tk_syns:
  229. tk = f"({tk} OR (%s)^0.2)" % " ".join(tk_syns)
  230. if tk:
  231. keywords.append(f"{tk}^{w}")
  232. return MatchTextExpr(self.query_fields, " ".join(keywords), 100,
  233. {"minimum_should_match": min(3, len(keywords) / 10)})