File size: 7,371 Bytes
1d5604f |
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 |
import re;
import sys
import xml.etree.ElementTree as ET
from itertools import groupby
from operator import attrgetter;
from pathlib import Path;
from graph import Graph;
from ucca import core, layer0, layer1, textutil;
from ucca.convert import to_standard
from ucca.ioutil import get_passages;
def convert_id(id, prefix):
m = re.search(r'wsj_([0-9]+)\.([0-9]+)', id);
if m:
return "2%04d%03d" % (int(m.group(1)), int(m.group(2)));
elif prefix:
return prefix + id;
else:
return id;
def passage2graph(passage, text=None, prefix=None):
graph = Graph(convert_id(passage.ID, prefix), flavor=1, framework="ucca");
l0 = passage.layer(layer0.LAYER_ID);
l1 = passage.layer(layer1.LAYER_ID);
unit_id_to_node_id = {};
n = None;
if text:
graph.add_input(text);
n = len(graph.input);
i = 0;
def skip():
nonlocal i;
while i < n and graph.input[i] in {" ", "\t"}:
i += 1;
def scan(candidates):
for candidate in candidates:
if graph.input.startswith(candidate, i):
return len(candidate);
def anchor(form):
nonlocal i;
skip();
m = None;
if graph.input.startswith(form, i):
m = len(form);
else:
for old, new in {("‘", "`"), ("’", "'")}:
form = form.replace(old, new);
if graph.input.startswith(form, i):
m = len(form);
break;
if not m:
m = scan({"“", "\"", "``"}) or scan({"‘", "`"}) \
or scan({"”", "\"", "''"}) or scan({"’", "'"}) \
or scan({"—", "—", "---", "--"}) \
or scan({"…", "...", ". . ."});
if m:
anchor = {"from": i, "to": i + m};
i += m;
skip();
return anchor;
else:
raise Exception("{}: failed to anchor |{}| in |{}| ({})"
"".format(graph.id, form, graph.input, i));
non_terminals = [unit for unit in l1.all if unit.tag in (layer1.NodeTags.Foundational, layer1.NodeTags.Punctuation)]
for token in sorted(l0.all, key=attrgetter("position")):
for unit in non_terminals:
if not unit.attrib.get("implicit"):
for edge in unit:
if "Terminal" in edge.tags and token.ID == edge.child.ID:
if unit.ID in unit_id_to_node_id:
node = graph.find_node(unit_id_to_node_id[unit.ID]);
if graph.input:
node.anchors.append(anchor(token.text));
else:
node = graph.add_node(anchors=[anchor(token.text)] if graph.input else None);
unit_id_to_node_id[unit.ID] = node.id;
for unit in sorted(non_terminals, key=attrgetter("start_position", "end_position")):
if not unit.attrib.get("implicit") and unit.ID not in unit_id_to_node_id:
node = graph.add_node();
unit_id_to_node_id[unit.ID] = node.id;
for unit in non_terminals:
for edge in unit:
for tag in edge.tags:
if tag != "Terminal":
if edge.child.ID in unit_id_to_node_id:
attributes, values = None, None;
if edge.attrib.get("remote"):
attributes = ["remote"];
values = [True];
graph.add_edge(unit_id_to_node_id[unit.ID],
unit_id_to_node_id[edge.child.ID],
tag,
attributes=attributes,
values=values);
else:
#
# quietly ignore edges to implicit nodes
#
pass;
for unit in l1.heads:
node_id = unit_id_to_node_id.get(unit.ID)
if node_id is not None:
graph.nodes[node_id].is_top = True;
return graph
def read(fp, text=None, prefix=None):
parent = Path(fp.name).parent;
paths = [parent / file.strip() for file in fp];
for passage in get_passages(map(str, paths)):
try:
graph = passage2graph(passage, text, prefix);
except Exception as exception:
print(exception);
continue;
yield graph, None;
def is_punct(node):
for edge in node.incoming_edges or ():
if edge.lab.upper() == "U":
return True
return False
def is_remote(edge):
for attribute, value in zip(edge.attributes or (), edge.values or ()):
if attribute == "remote" and value != "false":
return True
return False
def is_implicit(node):
for prop, value in zip(node.properties or (), node.values or ()):
if prop == "implicit" and value != "false":
return True
return False
def is_primary_root(node):
return all(is_remote(edge) for edge in node.incoming_edges)
def graph2passage(graph, input):
passage = core.Passage(graph.id)
l0 = layer0.Layer0(passage)
anchors = {(anchor["from"], anchor["to"], is_punct(node)) for node in graph.nodes for anchor in node.anchors or ()}
terminals = {(i, j): l0.add_terminal(text=input[i:j], punct=punct) for i, j, punct in sorted(anchors)}
l1 = layer1.Layer1(passage)
queue = [(node, None if node.is_top else layer1.FoundationalNode(root=l1.root,
tag=layer1.NodeTags.Foundational,
ID=l1.next_id()))
for node in graph.nodes if is_primary_root(node)]
id_to_unit = {node.id: unit for (node, unit) in queue}
remotes = []
while queue:
parent, parent_unit = queue.pop(0)
for tgt, edges in groupby(sorted(parent.outgoing_edges, key=attrgetter("tgt")), key=attrgetter("tgt")):
edges = list(edges)
labels = [edge.lab for edge in edges]
if is_remote(edges[0]):
remotes.append((parent_unit, labels, tgt))
else:
child = graph.find_node(tgt)
child_unit = id_to_unit[tgt] = l1.add_fnode_multiple(parent_unit, labels, implicit=is_implicit(child))
queue.append((child, child_unit))
for anchor in parent.anchors or ():
if parent_unit is None: # Terminal children of the root are not valid in UCCA, so warn but be faithful
print("graph2passage(): anchors of the root node converted to Terminal children in ‘{}’."
"".format(graph.id), file=sys.stderr)
parent_unit = l1.heads[0]
parent_unit.add(layer1.EdgeTags.Terminal, terminals[anchor["from"], anchor["to"]])
for parent, labels, tgt in remotes:
l1.add_remote_multiple(parent, labels, id_to_unit[tgt])
return passage
def write(graph, input, file):
passage = graph2passage(graph, input)
root = to_standard(passage)
xml_string = ET.tostring(root).decode()
output = textutil.indent_xml(xml_string)
file.write(output)
|