lkrsnik/STARK
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Added fixed node order

Browse Source
This commit is contained in:
Luka
2019-11-05 08:58:16 +01:00
parent 0fdfdb9556
commit 2476628087
2 changed files with 61 additions and 46 deletions
Download Patch File Download Diff File Expand all files Collapse all files
dependency-parsetree.py
+3 -7
View File
@@ -36,23 +36,19 @@ def decode_query(orig_query, dependency_type):
new_query = True
orig_query = orig_query[1:-1]
# if orig_query is '_' return {}
if dependency_type != '':
decoded_query = {'deprel': dependency_type}
else:
decoded_query = {}
if orig_query == '_':
return decoded_query
# if no spaces in query then this is query node and do this otherwise further split query
elif len(orig_query.split(' ')) == 1:
orig_query_split_parts = orig_query.split(' ')[0].split('&')
for orig_query_split_part in orig_query_split_parts:
orig_query_split = orig_query_split_part.split('=')
orig_query_split = orig_query_split_part.split('=', 1)
if len(orig_query_split) > 1:
if orig_query_split[0] == 'L':
decoded_query['lemma'] = orig_query_split[1]
@@ -266,9 +262,9 @@ def main():
filters = {}
filters['node_order'] = config.getboolean('settings', 'node_order')
for tree in all_trees[2:]:
# for tree in all_trees[2:]:
# for tree in all_trees[1205:]:
# for tree in all_trees:
for tree in all_trees:
# original
# r_children = tree.r_children[:1] + tree.r_children[3:4]
# tree.r_children = tree.r_children[:1] + tree.r_children[2:4]