Spaces:
Sleeping
Sleeping
File size: 11,859 Bytes
d3530f3 42cffde d3530f3 42cffde d3530f3 e7e6099 d3530f3 8e72e5b e7e6099 8e72e5b | 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 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 | """This module generates false answers within same context.
@Author: Karthick T. Sharma
"""
import os
import random
import urllib.request
import tarfile
import numpy as np
from sklearn.metrics.pairwise import cosine_similarity
from sentence_transformers import SentenceTransformer
from sense2vec import Sense2Vec
from src.utils.text_process import change_format
import tempfile
class FalseAnswerGenerator:
"""Generate false answers within same context."""
_instance = None
# def __init__(self):
# """Initialize false answer generation models."""
# self.__init_sentence_transformer()
# self.__init_sense2vec()
def __new__(cls):
if cls._instance is None:
cls._instance = super(FalseAnswerGenerator, cls).__new__(cls)
cls._instance._init_models()
return cls._instance
def _init_models(self):
self.__init_sentence_transformer()
self.__init_sense2vec()
def __init_sentence_transformer(self):
"""Initialize sentence embedding.
https://www.sbert.net/
"""
self._sentence_model = SentenceTransformer('all-MiniLM-L12-v2')
def __init_sense2vec(self):
"""Initialize word vectors to get similar words.
https://github.com/explosion/sense2vec
"""
if not os.path.isdir(os.getcwd() + '/s2v_old'):
s2v_url = "https://github.com/explosion/sense2vec/releases/download/"
s2v_ver_url = s2v_url + "v1.0.0/s2v_reddit_2015_md.tar.gz"
with urllib.request.urlopen(s2v_ver_url) as req:
# save downloaded to a temp file first
with tempfile.NamedTemporaryFile(delete=False) as temp_file:
temp_file.write(req.read())
temp_file_path = temp_file.name
with tarfile.open(temp_file_path, mode='r:gz') as file:
def is_within_directory(directory, target):
abs_directory = os.path.abspath(directory)
abs_target = os.path.abspath(target)
prefix = os.path.commonprefix([abs_directory, abs_target])
return prefix == abs_directory
def safe_extract(tar, path=".", members=None, *, numeric_owner=False):
for member in tar.getmembers():
member_path = os.path.join(path, member.name)
if not is_within_directory(path, member_path):
raise Exception("Attempted Path Traversal in Tar File")
tar.extractall(path, members, numeric_owner=numeric_owner)
safe_extract(file)
self._s2v = Sense2Vec().from_disk("s2v_old")
def __get_embedding(self, answer, distractors):
"""Returns sentence model embedding of answer and distractors.
Args:
answer (str): correct answer.
distractors (list[str]): false answers.
Returns:
tuple[list[str], list[str]]: sentence model embedding of answer and distractors.
"""
return self._sentence_model.encode([answer]), self._sentence_model.encode(distractors)
def get_embedding_list_word(self, word_list: list[str]):
"""
Returns sentence model embedding of answer and distractors.
"""
return self._sentence_model.encode([word_list])
def filter_output(self, orig, dummies):
"""Filter out final answers.
Args:
orig (str): correct answer.
dummies (list[str]): false answers list generated from correct answer.
Returns:
list[str]: list of final answer which has low similarity.
"""
ans_embedded, dis_embedded = self.__get_embedding(orig, dummies)
# filter using MMMR
dist = self.__mmr(ans_embedded, dis_embedded, dummies)
filtered_dist = []
for dis in dist:
# 0 -> word, 1 -> confidence / probability
filtered_dist.append(dis[0].capitalize())
return filtered_dist
def __mmr(self, doc_embedding, word_embedding, words, diversity=0.9):
"""Word diversity using MMR - Maximal Marginal Relevance.
Args:
doc_embedding (list[str]): sentence embedding of correct answer.
word_embedding (list[str]): sentence embedding of false answer.
words (list[str]): false answers.
diversity (float, optional): diversity coefficient. Defaults to 0.9.
Returns:
list[str]: list of final answers.
"""
# extract similarity between words and docs
word_doc_similarity = cosine_similarity(word_embedding, doc_embedding)
word_similarity = cosine_similarity(word_embedding)
kw_idx = [np.argmax(word_doc_similarity)] # NumPy 2.0.2 vẫn hỗ trợ np.argmax()
dist_idx = [i for i in range(len(words)) if i != kw_idx[0]]
for _ in range(3):
dist_similarities = word_doc_similarity[dist_idx, :]
target_similarities = np.max(
word_similarity[dist_idx][:, kw_idx], axis=1
)
# calculate MMR
mmr = (1 - diversity) * dist_similarities - \
diversity * target_similarities.reshape(-1, 1)
mmr_idx = dist_idx[np.argmax(mmr)] # NumPy vẫn hỗ trợ np.argmax()
# update kw
kw_idx.append(mmr_idx)
dist_idx.remove(mmr_idx)
return [(words[idx], round(float(word_doc_similarity.reshape(1, -1)[0][idx]), 4))
for idx in kw_idx]
def __generate_answer(self, query):
"""Generate false answers from correct answer.
Args:
query (str): correct answer.
Returns:
list(str): list of final answers if input is valid, else None.
"""
# get the best sense for given word (like NOUN, PRONOUN, VERB...)
query_al = self._s2v.get_best_sense(query.lower().replace(' ', '_'))
if query_al is None:
return None
try:
assert query_al in self._s2v
# get most similar 20 words (if any)
temp = self._s2v.most_similar(query_al, n=20)
formatted_string = change_format(temp)
formatted_string.insert(0, query)
# if answers are numbers then we don't need to filter
if query_al.split('|')[1] == 'CARDINAL':
return formatted_string[:4]
# else filter because sometimes similar words will be US, U.S, USA, AMERICA...
return self.filter_output(query, formatted_string)
except AssertionError:
return None
def get_output(self, filtered_kws):
"""Generate false answers for whole context.
Filter out keywords that don't generate 3 false answers.
Args:
filtered_kws (list(str)): list of keywords
Returns:
tuple(list(str), list(list(str))): tuple of correct answers and list of all answers.
"""
crct_ans = []
all_answers = []
for kws in filtered_kws:
for kwx in kws:
results = self.__generate_answer(kwx)
if results is not None:
crct_ans.append(kwx.capitalize())
random.shuffle(results)
all_answers.append(results)
return crct_ans, sum(all_answers, [])
def generate_distractors_from_synonyms(
self,
correct_words: list[str],
num_distractors: int = 3,
sim_min: float = 0.35,
sim_max: float = 0.75
):
"""
Generate distractors for synonym questions.
Input: 2 correct synonymous words
Output: distractors semantically related but NOT synonyms
"""
assert len(correct_words) == 2, "Require exactly 2 correct synonyms"
w1, w2 = [w.lower().strip() for w in correct_words]
candidates = set()
# -------- 1. Collect candidates from sense2vec ----------
for w in [w1, w2]:
sense = self._s2v.get_best_sense(w.replace(" ", "_"))
if sense and sense in self._s2v:
sims = self._s2v.most_similar(sense, n=30)
formatted = change_format(sims)
candidates.update(formatted)
# Remove originals
candidates = {
c for c in candidates
if c.lower() not in {w1, w2}
}
if not candidates:
return []
candidates = list(candidates)
# -------- 2. Sentence embedding ----------
emb_correct = self._sentence_model.encode(correct_words)
emb_candidates = self._sentence_model.encode(candidates)
# similarity to each correct word
sim_1 = cosine_similarity(emb_candidates, emb_correct[0].reshape(1, -1))
sim_2 = cosine_similarity(emb_candidates, emb_correct[1].reshape(1, -1))
final_candidates = []
for idx, word in enumerate(candidates):
s1 = sim_1[idx][0]
s2 = sim_2[idx][0]
# loại bỏ các từ quá giống
if max(s1, s2) > sim_max:
continue
# loại bỏ các từ quá khác
if max(s1, s2) < sim_min:
continue
final_candidates.append((word, max(s1, s2)))
chosen = random.sample(
final_candidates,
k=min(num_distractors, len(final_candidates))
)
return [w.capitalize() for w, _ in chosen]
def generate_distractors_from_antonyms(
self,
correct_words: list[str],
num_distractors: int = 3,
sim_min: float = 0.25,
sim_max: float = 0.8,
balance_threshold: float = 0.2
):
"""
Generate distractors for antonym questions.
Input: 2 opposite words
Output: neutral / intermediate distractors
"""
assert len(correct_words) == 2, "Require exactly 2 antonyms"
w1, w2 = [w.lower().strip() for w in correct_words]
candidates = set()
# -------- 1. Collect candidates from both antonyms ----------
for w in [w1, w2]:
sense = self._s2v.get_best_sense(w.replace(" ", "_"))
if sense and sense in self._s2v:
sims = self._s2v.most_similar(sense, n=40)
candidates.update(change_format(sims))
# Remove originals
candidates = {
c for c in candidates
if c.lower() not in {w1, w2}
}
if not candidates:
return []
candidates = list(candidates)
# -------- 2. Sentence embedding ----------
emb_correct = self._sentence_model.encode(correct_words)
emb_candidates = self._sentence_model.encode(candidates)
sim_1 = cosine_similarity(emb_candidates, emb_correct[0].reshape(1, -1))
sim_2 = cosine_similarity(emb_candidates, emb_correct[1].reshape(1, -1))
final_candidates = []
for idx, word in enumerate(candidates):
s1 = sim_1[idx][0]
s2 = sim_2[idx][0]
# quá gần một cực → loại
if max(s1, s2) > sim_max:
continue
# quá xa cả hai → loại
if max(s1, s2) < sim_min:
continue
# không cân bằng → nghiêng hẳn về 1 phía
if abs(s1 - s2) > balance_threshold:
continue
final_candidates.append(
(word, (s1 + s2) / 2)
)
if not final_candidates:
return []
chosen = random.sample(
final_candidates,
k=min(num_distractors, len(final_candidates))
)
return [w.capitalize() for w, _ in chosen]
|