def test_single_root_induction(self):
tree = hybrid_tree_1()
# print tree.children("v")
# print tree
#
# for id_set in ['v v1 v2 v21'.split(' '), 'v1 v2'.split(' '),
# 'v v21'.split(' '), ['v'], ['v1'], ['v2'], ['v21']]:
# print id_set, 'top:', top(tree, id_set), 'bottom:', bottom(tree, id_set)
# print id_set, 'top_max:', max(tree, top(tree, id_set)), 'bottom_max:', max(tree, bottom(tree, id_set))
#
# print "some rule"
# for mem, arg in [(-1, 0), (0,0), (1,0)]:
# print create_DCP_rule(mem, arg, top_max(tree, ['v','v1','v2','v21']), bottom_max(tree, ['v','v1','v2','v21']),
# [(top_max(tree, l), bottom_max(tree, l)) for l in [['v1', 'v2'], ['v', 'v21']]])
#
#
# print "some other rule"
# for mem, arg in [(-1,1),(1,0)]:
# print create_DCP_rule(mem, arg, top_max(tree, ['v1','v2']), bottom_max(tree, ['v1','v2']),
# [(top_max(tree, l), bottom_max(tree, l)) for l in [['v1'], ['v2']]])
#
# print 'strict:' , strict_labeling(tree, top_max(tree, ['v','v21']), bottom_max(tree, ['v','v21']))
# print 'child:' , child_labeling(tree, top_max(tree, ['v','v21']), bottom_max(tree, ['v','v21']))
# print '---'
# print 'strict: ', strict_labeling(tree, top_max(tree, ['v1','v21']), bottom_max(tree, ['v1','v21']))
# print 'child: ', child_labeling(tree, top_max(tree, ['v1','v21']), bottom_max(tree, ['v1','v21']))
# print '---'
# print 'strict:' , strict_labeling(tree, top_max(tree, ['v','v1', 'v21']), bottom_max(tree, ['v','v1', 'v21']))
# print 'child:' , child_labeling(tree, top_max(tree, ['v','v1', 'v21']), bottom_max(tree, ['v','v1', 'v21']))
tree2 = hybrid_tree_2()
# print tree2.children("v")
# print tree2
#
# print 'siblings v211', tree2.siblings('v211')
# print top(tree2, ['v','v1', 'v211'])
# print top_max(tree2, ['v','v1', 'v211'])
#
# print '---'
# print 'strict:' , strict_labeling(tree2, top_max(tree2, ['v','v1', 'v211']), bottom_max(tree2, ['v','v11', 'v211']))
# print 'child:' , child_labeling(tree2, top_max(tree2, ['v','v1', 'v211']), bottom_max(tree2, ['v','v11', 'v211']))
# rec_par = ('v v1 v2 v21'.split(' '),
# [('v1 v2'.split(' '), [(['v1'],[]), (['v2'],[])])
# ,('v v21'.split(' '), [(['v'],[]), (['v21'],[])])
# ])
#
# grammar = LCFRS(nonterminal_str(tree, top_max(tree, rec_par[0]), bottom_max(tree, rec_par[0]), 'strict'))
#
# add_rules_to_grammar_rec(tree, rec_par, grammar, 'child')
#
# grammar.make_proper()
# print grammar
print(tree.recursive_partitioning())
terminal_labeling = the_terminal_labeling_factory().get_strategy('pos')
(_, grammar) = induce_grammar(
[tree, tree2],
the_labeling_factory().create_simple_labeling_strategy(
'empty', 'pos'),
# the_labeling_factory().create_simple_labeling_strategy('child', 'pos+deprel'),
terminal_labeling.token_label,
[direct_extraction],
'START')
print(max([grammar.fanout(nont) for nont in grammar.nonts()]))
print(grammar)
parser = LCFRS_parser(grammar, 'NP N V V'.split(' '))
print(parser.best_derivation_tree())
tokens = [
construct_conll_token(form, pos) for form, pos in zip(
'Piet Marie helpen lezen'.split(' '), 'NP N V V'.split(' '))
]
hybrid_tree = HybridTree()
hybrid_tree = parser.dcp_hybrid_tree_best_derivation(
hybrid_tree, tokens, True, construct_conll_token)
print(list(map(str, hybrid_tree.full_token_yield())))
print(hybrid_tree)
string = "foo"
dcp_string = DCP_string(string)
dcp_string.set_edge_label("bar")
print(dcp_string, dcp_string.edge_label())
linearize(
grammar,
the_labeling_factory().create_simple_labeling_strategy(
'child', 'pos+deprel'),
the_terminal_labeling_factory().get_strategy('pos'), sys.stdout)
class GeneralHybridTreeTestCase(unittest.TestCase):
tree = None
def setUp(self):
self.tree = HybridTree()
self.tree.add_node("v1", construct_conll_token("Piet", "NP"), True)
self.tree.add_node("v21", construct_conll_token("Marie", "N"), True)
self.tree.add_node("v", construct_conll_token("helpen", "VP"), True)
self.tree.add_node("v2", construct_conll_token("lezen", "V"), True)
self.tree.add_child("v", "v2")
self.tree.add_child("v", "v1")
self.tree.add_child("v2", "v21")
self.tree.add_node("v3", construct_conll_token(".", "Punc"), True,
False)
self.tree.add_to_root("v")
def test_children(self):
self.assertListEqual(self.tree.children('v'), ['v2', 'v1'])
self.tree.reorder()
self.assertListEqual(self.tree.children('v'), ['v1', 'v2'])
def test_fringe(self):
self.tree.reorder()
self.assertListEqual(self.tree.fringe('v'), [2, 0, 3, 1])
self.assertListEqual(self.tree.fringe('v2'), [3, 1])
def test_n_spans(self):
self.tree.reorder()
self.assertEqual(self.tree.n_spans('v'), 1)
self.assertEqual(self.tree.n_spans('v2'), 2)
def test_n_gaps(self):
self.tree.reorder()
self.assertEqual(self.tree.n_gaps(), 1)
def test_node_ids(self):
self.tree.reorder()
self.assertListEqual(sorted(self.tree.nodes()),
sorted(['v', 'v1', 'v2', 'v21', 'v3']))
def test_complete(self):
self.tree.reorder()
self.assertEqual(self.tree.complete(), True)
def test_unlabelled_structure(self):
self.tree.reorder()
self.assertTupleEqual(self.tree.unlabelled_structure(),
({0, 1, 2, 3}, [({0}, []),
({1, 3}, [({1}, [])])]))
def test_max_n_spans(self):
self.tree.reorder()
self.assertEqual(self.tree.max_n_spans(), 2)
def test_labelled_yield(self):
self.tree.reorder()
self.assertListEqual(
[token.form() for token in self.tree.token_yield()],
"Piet Marie helpen lezen".split(' '))
def test_full_labelled_yield(self):
self.tree.reorder()
self.assertListEqual(
[token.form() for token in self.tree.full_token_yield()],
"Piet Marie helpen lezen .".split(' '))
def test_full_yield(self):
self.tree.reorder()
self.assertListEqual(self.tree.full_yield(),
'v1 v21 v v2 v3'.split(' '))
# def test_labelled_spans(self):
# self.tree.reorder()
# self.assertListEqual(self.tree.labelled_spans(), [])
def test_pos_yield(self):
self.tree.reorder()
self.assertListEqual(
[token.pos() for token in self.tree.token_yield()],
"NP N VP V".split(' '))
def test_recursive_partitioning(self):
self.tree.reorder()
self.assertEqual(self.tree.recursive_partitioning(),
({0, 1, 2, 3}, [({0}, []),
({1, 3}, [({1}, []), ({3}, [])]),
({2}, [])]))