Newer
Older
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
#!/usr/bin/env python3
import csv
import sys
def EDdARow(columns):
return {
'tome': columns[0],
'article': columns[1],
'head': columns[2],
}
def LGERow(tome):
return lambda columns: {
'id': columns[0],
'tome': tome,
'rank': columns[1],
'head': columns[2]
}
def unserializeMetadata(path, rowReader):
with open(path) as f:
inputFile = csv.reader(f)
articles = []
header = True
for row in inputFile:
if header:
header = False
else:
yield rowReader(row)
def concat(generators):
for g in generators:
for x in g:
yield x
def naiveIndexBy(field, elements):
d = {}
for e in elements:
key = e[field]
if key in d:
d[key] = None
else:
d[key] = e
return d
def growPrefixes(d, keys, maxLength):
for length in range(maxLength, 1, -1):
newGeneration = {}
for key in keys:
if len(key) == length:
newKey = key[:-1]
if newKey in newGeneration or newKey in d:
newGeneration[newKey] = None
else:
newGeneration[newKey] = d[key]
for key, value in newGeneration.items():
if value is not None:
d[key] = value
keys.add(key)
elif key not in d:
d[key] = value
def indexBy(field, elements, prefix=True):
d = {}
for e in elements:
key = e[field]
if key in d:
d[key] = None
else:
d[key] = e
if prefix:
keys = set(d.keys())
growPrefixes(d, keys, max(map(len, keys)))
return d
def headWords(head):
words = head.split()
if len(words) == 1:
return words
else:
return [w for w in map(lambda s: s.strip(',.'), words) if w.isupper()]
def identify(head, haystack):
if head in haystack:
if haystack[head] is not None:
return {'type': 'exact', 'match': head, 'found': haystack[head]}
else:
return None
else:
prefix = head[:-1]
while len(prefix) > 0 and prefix not in haystack:
prefix = prefix[:-1]
if prefix in haystack and haystack[prefix] is not None:
return {
'type': 'prefix',
'match': head,
'found': haystack[prefix],
'precision': len(prefix) / len(head)
}
else:
return None
def naiveGetArrows(source, target):
indexedSource = naiveIndexBy('head', source)
indexedTarget = naiveIndexBy('head', target)
for head, article in indexedSource.items():
if article is not None and head in indexedTarget and indexedTarget[head] is not None:
yield {
'source': article,
'target': indexedTarget[head]
}
def getArrows(source, target):
for article in source:
heads = headWords(article['head'])
identified = map(lambda w: identify(w, target), heads)
entries = [e for e in identified if e is not None]
if len(entries) == 1:
yield {
'type': 'match',
'source': article,
'target': entries[0]
}
elif len(entries) > 1:
yield {
'type': 'ambiguity',
'source': article,
'target': entries
}
def interesting(arrow):
if arrow['type'] == 'match':
target = arrow['target']
return len(target['match']) > 3 and (target['type'] == 'exact' or target['precision'] > 0.8)
#gold = [a for a in arrows if interesting(a)]
def getMetadata(arrows, path=None):
output = sys.stdout if path is None else open(path, 'w')
toCsv = csv.writer(output, lineterminator='\n')
toCsv.writerow(
['head', 'id', 'tomeEDdA', 'rankEDdA', 'tomeLGE', 'rankLGE']
)
for arrow in arrows:
toCsv.writerow([
arrow['target']['head'],
arrow['target']['id'],
arrow['source']['tome'],
arrow['source']['article'],
arrow['target']['tome'],
arrow['target']['rank']
])
if __name__ == '__main__':
edda = list(unserializeMetadata(sys.argv[1], EDdARow))
lge = list(concat([
unserializeMetadata(f'{sys.argv[2]}/T{T}/metadata.csv', LGERow(T)) for T in range(1, 32)
]))
getMetadata(list(naiveGetArrows(edda, lge)), sys.argv[3])