Du kannst nicht mehr als 25 Themen auswählen Themen müssen mit entweder einem Buchstaben oder einer Ziffer beginnen. Sie können Bindestriche („-“) enthalten und bis zu 35 Zeichen lang sein.

query.py 8.7KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234
  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 rag.utils.doc_store_conn import MatchTextExpr
  20. from rag.nlp import rag_tokenizer, term_weight, synonym
  21. class FulltextQueryer:
  22. def __init__(self):
  23. self.tw = term_weight.Dealer()
  24. self.syn = synonym.Dealer()
  25. self.query_fields = [
  26. "title_tks^10",
  27. "title_sm_tks^5",
  28. "important_kwd^30",
  29. "important_tks^20",
  30. "question_tks^20",
  31. "content_ltks^2",
  32. "content_sm_ltks",
  33. ]
  34. @staticmethod
  35. def subSpecialChar(line):
  36. return re.sub(r"([:\{\}/\[\]\-\*\"\(\)\|\+~\^])", r"\\\1", line).strip()
  37. @staticmethod
  38. def isChinese(line):
  39. arr = re.split(r"[ \t]+", line)
  40. if len(arr) <= 3:
  41. return True
  42. e = 0
  43. for t in arr:
  44. if not re.match(r"[a-zA-Z]+$", t):
  45. e += 1
  46. return e * 1.0 / len(arr) >= 0.7
  47. @staticmethod
  48. def rmWWW(txt):
  49. patts = [
  50. (
  51. r"是*(什么样的|哪家|一下|那家|请问|啥样|咋样了|什么时候|何时|何地|何人|是否|是不是|多少|哪里|怎么|哪儿|怎么样|如何|哪些|是啥|啥是|啊|吗|呢|吧|咋|什么|有没有|呀|谁|哪位|哪个)是*",
  52. "",
  53. ),
  54. (r"(^| )(what|who|how|which|where|why)('re|'s)? ", " "),
  55. (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) ", " ")
  56. ]
  57. for r, p in patts:
  58. txt = re.sub(r, p, txt, flags=re.IGNORECASE)
  59. return txt
  60. def question(self, txt, tbl="qa", min_match:float=0.6):
  61. txt = re.sub(
  62. r"[ :|\r\n\t,,。??/`!!&^%%()\[\]{}<>]+",
  63. " ",
  64. rag_tokenizer.tradi2simp(rag_tokenizer.strQ2B(txt.lower())),
  65. ).strip()
  66. txt = FulltextQueryer.rmWWW(txt)
  67. if not self.isChinese(txt):
  68. txt = FulltextQueryer.rmWWW(txt)
  69. tks = rag_tokenizer.tokenize(txt).split()
  70. keywords = [t for t in tks if t]
  71. tks_w = self.tw.weights(tks, preprocess=False)
  72. tks_w = [(re.sub(r"[ \\\"'^]", "", tk), w) for tk, w in tks_w]
  73. tks_w = [(re.sub(r"^[a-z0-9]$", "", tk), w) for tk, w in tks_w if tk]
  74. tks_w = [(re.sub(r"^[\+-]", "", tk), w) for tk, w in tks_w if tk]
  75. tks_w = [(tk.strip(), w) for tk, w in tks_w if tk.strip()]
  76. syns = []
  77. for tk, w in tks_w:
  78. syn = self.syn.lookup(tk)
  79. syn = rag_tokenizer.tokenize(" ".join(syn)).split()
  80. keywords.extend(syn)
  81. syn = ["\"{}\"^{:.4f}".format(s, w / 4.) for s in syn if s.strip()]
  82. syns.append(" ".join(syn))
  83. q = ["({}^{:.4f}".format(tk, w) + " {})".format(syn) for (tk, w), syn in zip(tks_w, syns) if tk and not re.match(r"[.^+\(\)-]", tk)]
  84. for i in range(1, len(tks_w)):
  85. left, right = tks_w[i - 1][0].strip(), tks_w[i][0].strip()
  86. if not left or not right:
  87. continue
  88. q.append(
  89. '"%s %s"^%.4f'
  90. % (
  91. tks_w[i - 1][0],
  92. tks_w[i][0],
  93. max(tks_w[i - 1][1], tks_w[i][1]) * 2,
  94. )
  95. )
  96. if not q:
  97. q.append(txt)
  98. query = " ".join(q)
  99. return MatchTextExpr(
  100. self.query_fields, query, 100
  101. ), keywords
  102. def need_fine_grained_tokenize(tk):
  103. if len(tk) < 3:
  104. return False
  105. if re.match(r"[0-9a-z\.\+#_\*-]+$", tk):
  106. return False
  107. return True
  108. txt = FulltextQueryer.rmWWW(txt)
  109. qs, keywords = [], []
  110. for tt in self.tw.split(txt)[:256]: # .split():
  111. if not tt:
  112. continue
  113. keywords.append(tt)
  114. twts = self.tw.weights([tt])
  115. syns = self.syn.lookup(tt)
  116. if syns and len(keywords) < 32:
  117. keywords.extend(syns)
  118. logging.debug(json.dumps(twts, ensure_ascii=False))
  119. tms = []
  120. for tk, w in sorted(twts, key=lambda x: x[1] * -1):
  121. sm = (
  122. rag_tokenizer.fine_grained_tokenize(tk).split()
  123. if need_fine_grained_tokenize(tk)
  124. else []
  125. )
  126. sm = [
  127. re.sub(
  128. r"[ ,\./;'\[\]\\`~!@#$%\^&\*\(\)=\+_<>\?:\"\{\}\|,。;‘’【】、!¥……()——《》?:“”-]+",
  129. "",
  130. m,
  131. )
  132. for m in sm
  133. ]
  134. sm = [FulltextQueryer.subSpecialChar(m) for m in sm if len(m) > 1]
  135. sm = [m for m in sm if len(m) > 1]
  136. if len(keywords) < 32:
  137. keywords.append(re.sub(r"[ \\\"']+", "", tk))
  138. keywords.extend(sm)
  139. tk_syns = self.syn.lookup(tk)
  140. tk_syns = [FulltextQueryer.subSpecialChar(s) for s in tk_syns]
  141. if len(keywords) < 32:
  142. keywords.extend([s for s in tk_syns if s])
  143. tk_syns = [rag_tokenizer.fine_grained_tokenize(s) for s in tk_syns if s]
  144. tk_syns = [f"\"{s}\"" if s.find(" ")>0 else s for s in tk_syns]
  145. if len(keywords) >= 32:
  146. break
  147. tk = FulltextQueryer.subSpecialChar(tk)
  148. if tk.find(" ") > 0:
  149. tk = '"%s"' % tk
  150. if tk_syns:
  151. tk = f"({tk} OR (%s)^0.2)" % " ".join(tk_syns)
  152. if sm:
  153. tk = f'{tk} OR "%s" OR ("%s"~2)^0.5' % (" ".join(sm), " ".join(sm))
  154. if tk.strip():
  155. tms.append((tk, w))
  156. tms = " ".join([f"({t})^{w}" for t, w in tms])
  157. if len(twts) > 1:
  158. tms += ' ("%s"~2)^1.5' % rag_tokenizer.tokenize(tt)
  159. if re.match(r"[0-9a-z ]+$", tt):
  160. tms = f'("{tt}" OR "%s")' % rag_tokenizer.tokenize(tt)
  161. syns = " OR ".join(
  162. [
  163. '"%s"'
  164. % rag_tokenizer.tokenize(FulltextQueryer.subSpecialChar(s))
  165. for s in syns
  166. ]
  167. )
  168. if syns:
  169. tms = f"({tms})^5 OR ({syns})^0.7"
  170. qs.append(tms)
  171. if qs:
  172. query = " OR ".join([f"({t})" for t in qs if t])
  173. return MatchTextExpr(
  174. self.query_fields, query, 100, {"minimum_should_match": min_match}
  175. ), keywords
  176. return None, keywords
  177. def hybrid_similarity(self, avec, bvecs, atks, btkss, tkweight=0.3, vtweight=0.7):
  178. from sklearn.metrics.pairwise import cosine_similarity as CosineSimilarity
  179. import numpy as np
  180. sims = CosineSimilarity([avec], bvecs)
  181. tksim = self.token_similarity(atks, btkss)
  182. return np.array(sims[0]) * vtweight + np.array(tksim) * tkweight, tksim, sims[0]
  183. def token_similarity(self, atks, btkss):
  184. def toDict(tks):
  185. d = {}
  186. if isinstance(tks, str):
  187. tks = tks.split()
  188. for t, c in self.tw.weights(tks, preprocess=False):
  189. if t not in d:
  190. d[t] = 0
  191. d[t] += c
  192. return d
  193. atks = toDict(atks)
  194. btkss = [toDict(tks) for tks in btkss]
  195. return [self.similarity(atks, btks) for btks in btkss]
  196. def similarity(self, qtwt, dtwt):
  197. if isinstance(dtwt, type("")):
  198. dtwt = {t: w for t, w in self.tw.weights(self.tw.split(dtwt), preprocess=False)}
  199. if isinstance(qtwt, type("")):
  200. qtwt = {t: w for t, w in self.tw.weights(self.tw.split(qtwt), preprocess=False)}
  201. s = 1e-9
  202. for k, v in qtwt.items():
  203. if k in dtwt:
  204. s += v # * dtwt[k]
  205. q = 1e-9
  206. for k, v in qtwt.items():
  207. q += v
  208. return s / q