forked from teowu/lmms-eval
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathvqa_metric.py
More file actions
268 lines (224 loc) · 9.03 KB
/
vqa_metric.py
File metadata and controls
268 lines (224 loc) · 9.03 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
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
import math
import re
def levenshtein_distance(s1, s2):
if len(s1) > len(s2):
s1, s2 = s2, s1
distances = range(len(s1) + 1)
for i2, c2 in enumerate(s2):
distances_ = [i2 + 1]
for i1, c1 in enumerate(s1):
if c1 == c2:
distances_.append(distances[i1])
else:
distances_.append(1 + min((distances[i1], distances[i1 + 1], distances_[-1])))
distances = distances_
return distances[-1]
def vqa_evaluation(predict, answers):
score = 0
if type(answers) == list:
for j in range(len(answers)):
if isinstance(answers[j], (int, float)):
answers[j] = str(answers[j])
answer = str(answers[j]).lower().strip().replace("\n", " ")
if isinstance(predict, (int, float)):
predict = str(predict)
predict = predict.lower().strip().replace("\n", " ")
if len(answer.split()) < 5:
if answer in predict:
score = 1
else:
dist = levenshtein_distance(predict, answer)
length = max(len(predict), len(answer))
ANLS_value = 0.0 if length == 0 else float(dist) / float(length)
ANLS_value = 1 - ANLS_value
if ANLS_value >= 0.5 and ANLS_value > score:
score = ANLS_value
else:
answers = answers.lower().strip().replace("\n", " ")
predict = predict.lower().strip().replace("\n", " ")
if len(answers.split()) < 5:
if answers in predict:
score = 1
else:
dist = levenshtein_distance(predict, answers)
length = max(len(predict), len(answers))
ANLS_value = 0.0 if length == 0 else float(dist) / float(length)
ANLS_value = 1 - ANLS_value
if ANLS_value >= 0.5 and ANLS_value > score:
score = ANLS_value
return score
def cn_vqa_evaluation(predict, answers):
score = 0
if type(answers) == list:
for j in range(len(answers)):
if isinstance(answers[j], (int, float)):
answers[j] = str(answers[j])
answer = str(answers[j]).lower().strip().replace("\n", " ").replace(" ", "")
if isinstance(predict, (int, float)):
predict = str(predict)
predict = predict.lower().strip().replace("\n", " ").replace(" ", "")
if len(answer.split(",")) < 4:
if answer in predict:
score = 1
else:
dist = levenshtein_distance(predict, answer)
length = max(len(predict), len(answer))
ANLS_value = 0.0 if length == 0 else float(dist) / float(length)
ANLS_value = 1 - ANLS_value
if ANLS_value >= 0.5 and ANLS_value > score:
score = ANLS_value
else:
answers = answers.lower().strip().replace("\n", " ").replace(" ", "")
predict = predict.lower().strip().replace("\n", " ").replace(" ", "")
if len(answers.split(",")) < 4:
if answers in predict:
score = 1
else:
dist = levenshtein_distance(predict, answers)
length = max(len(predict), len(answers))
ANLS_value = 0.0 if length == 0 else float(dist) / float(length)
ANLS_value = 1 - ANLS_value
if ANLS_value >= 0.5 and ANLS_value > score:
score = ANLS_value
return score
def vqa_evaluation_case_sensitive(predict, answers):
score = 0
if type(answers) == list:
for j in range(len(answers)):
if isinstance(answers[j], (int, float)):
answers[j] = str(answers[j])
answer = str(answers[j]).strip().replace("\n", " ")
predict = predict.strip().replace("\n", " ")
if len(answer.split()) < 5:
if answer in predict:
score = 1
else:
dist = levenshtein_distance(predict, answer)
length = max(len(predict), len(answer))
ANLS_value = 0.0 if length == 0 else float(dist) / float(length)
ANLS_value = 1 - ANLS_value
if ANLS_value >= 0.5 and ANLS_value > score:
score = ANLS_value
else:
answers = answers.strip().replace("\n", " ")
predict = predict.strip().replace("\n", " ")
if len(answers.split()) < 5:
if answers in predict:
score = 1
else:
dist = levenshtein_distance(predict, answers)
length = max(len(predict), len(answers))
ANLS_value = 0.0 if length == 0 else float(dist) / float(length)
ANLS_value = 1 - ANLS_value
if ANLS_value >= 0.5 and ANLS_value > score:
score = ANLS_value
return score
def extract_first_number(string):
match = re.search(r"\d+", string)
if match:
return int(match.group())
return None
def counting_evaluation(predict, answers, eval_method):
score = 0
if isinstance(predict, str):
predict_processed = predict.lower().strip().replace("\n", " ")
elif math.isnan(predict):
return 0
else:
predict_processed = int(predict)
if type(answers) == list:
temp_score = 0
for j in range(len(answers)):
if isinstance(answers[j], (int, float)):
answers[j] = str(answers[j])
answer = answers[j].lower().strip().replace("\n", " ")
if eval_method == "exact match":
if answer in predict:
score = 1
else:
score = 0
elif eval_method == "regression":
predict_number = extract_first_number(predict_processed)
if predict_number:
answer = int(answer)
if predict_number <= 0 or predict_number >= 2 * answer:
score = 0
else:
iou = 1 - abs(predict_number - answer) / answer
if iou > 0.5:
score = iou
else:
score = 0
else:
score = 0
if score > temp_score:
temp_score = score
score = temp_score
else:
answers = answers.lower().strip().replace("\n", " ")
predict = predict_processed
if eval_method == "exact match":
if answers in predict:
score = 1
else:
score = 0
elif eval_method == "regression":
predict = extract_first_number(predict)
if predict:
answer = int(answers)
if predict <= 0 or predict >= 2 * answer:
score = 0
else:
iou = 1 - abs(predict - answer) / answer
if iou > 0.5:
score = iou
else:
score = 0
else:
score = 0
return score
def math_expression_evaluation(predict, answers):
score = 0
if type(answers) == list:
for j in range(len(answers)):
answer = answers[j].strip().replace("\n", " ").replace(" ", "")
predict = predict.strip().replace("\n", " ").replace(" ", "")
if answer in predict:
score = 1
else:
answers = answers.strip().replace("\n", " ").replace(" ", "")
predict = predict.strip().replace("\n", " ").replace(" ", "")
if answers in predict:
score = 1
return score
def remove_text_tags(latex_str):
"""
Removes LaTeX \text{...} tags while keeping their content.
:param latex_str: A string containing LaTeX expressions
:return: The processed string with \text{...} tags removed
"""
pattern = r"\\text\{([^{}]*)\}"
processed_str = re.sub(pattern, r"\1", latex_str)
return processed_str
def cn_math_expression_evaluation(predict, answers):
score = 0
assert len(answers) == 1
answers = [remove_text_tags(answers[0])]
predict = remove_text_tags(predict)
if type(answers) == list:
for j in range(len(answers)):
answer = answers[j].strip().replace("\n", " ").replace(" ", "")
predict = predict.strip().replace("\n", " ").replace(" ", "")
if answer in predict:
score = 1
else:
answers = answers.strip().replace("\n", " ").replace(" ", "")
predict = predict.strip().replace("\n", " ").replace(" ", "")
if answers in predict:
score = 1
return score
if __name__ == "__main__":
test_predict = "apple pie and banana"
test_answers = ["apple", "banana pie", "apple pie and orange"]
vqa_score = vqa_evaluation(test_predict, test_answers)
print(f"VQA evaluation score for predict '{test_predict}' and answers {test_answers}: {vqa_score}")