-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBooleanQuery.py
More file actions
134 lines (106 loc) · 3.8 KB
/
BooleanQuery.py
File metadata and controls
134 lines (106 loc) · 3.8 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
import json
import os
import re
from langchain_community.document_loaders import TextLoader
from langchain_core.documents import Document
class BooleanQueryParser:
def __init__(self, query):
self.tokens = self.tokenize(query)
self.pos = 0
def tokenize(self, query):
pattern = r'\(|\)|NOT|AND|OR|"[^"]+"|\w+'
tokens = re.findall(pattern, query)
return [t.upper() if t in {"AND", "OR", "NOT"} else t.replace('"',"").strip() for t in tokens]
def parse(self):
return self.expr()
def expr(self):
node = self.term()
while self.pos < len(self.tokens) and self.tokens[self.pos] == "OR":
self.pos += 1
node = ("OR", node, self.term())
return node
def term(self):
node = self.factor()
while self.pos < len(self.tokens) and self.tokens[self.pos] == "AND":
self.pos += 1
node = ("AND", node, self.factor())
return node
def factor(self):
if self.pos < len(self.tokens) and self.tokens[self.pos] == "NOT":
self.pos += 1
return ("NOT", self.factor())
return self.primary()
def primary(self):
if self.pos < len(self.tokens) and self.tokens[self.pos] == "(":
self.pos += 1
node = self.expr()
if self.pos < len(self.tokens) and self.tokens[self.pos] == ")":
self.pos += 1
return node
raise ValueError("Unmatched parenthesis")
elif self.pos < len(self.tokens):
node = self.tokens[self.pos]
self.pos += 1
return node
raise ValueError("Unexpected end of expression")
# # Esempio di utilizzo:
#query = ("Testa di idra AND (True OR NOT (True AND False))")
#booleanQuery = BooleanQueryParser(query).tokens
#print(booleanQuery)
# parser = BooleanQueryParser(query)
# parsed_tree = parser.parse()
def boolean_searcher(query,doc_splits, lower=True,header=False):
def evaluate(tree):
if isinstance(tree, tuple):
if tree[0] == "AND":
return evaluate(tree[1]) and evaluate(tree[2])
elif tree[0] == "OR":
return evaluate(tree[1]) or evaluate(tree[2])
elif tree[0] == "NOT":
return not evaluate(tree[1])
if lower:
return (tree.lower() in chunk.replace("\n", " ").lower())
return (tree in chunk.replace("\n", " "))
results = []
if header:
pre_id=-1
for doc in doc_splits:
chunk= doc.page_content
if doc.metadata["id"]!=pre_id:
pre_id = doc.metadata["id"]
if evaluate(query):
results.append(doc)
else:
for doc in doc_splits:
chunk= doc.page_content
if evaluate(query):
results.append(doc)
dict_results = {}
for doc in results:
if doc.metadata["id"] not in dict_results:
dict_results[doc.metadata["id"]] = [doc.page_content]
dict_results[doc.metadata["id"]].append(doc.page_content)
return dict_results
#
# query = """("Shard di Materia Oscura" AND "Uova di Fenice")"""
#
# menu_paths = [
# os.path.join("Menu", path) for path in os.listdir("Menu") if path.endswith(".txt")
# ]
#
# # Load menu documents
# menu_docs = [TextLoader(path).load() for path in menu_paths]
# menu_docs_list = [item for sublist in menu_docs for item in sublist]
#
# doc_splits = my_splitter(menu_docs_list)
#
# parser = BooleanQueryParser(query)
# parsed_tree = parser.parse()
# print(parsed_tree)
#
# documents=boolean_searcher(parsed_tree,doc_splits)
#
# for doc in documents:
# print(doc.metadata)
# print(doc.page_content)
# print("\n##############################################################################################\n")