Esempio n. 1
0
    def test_cyk_parse_pcfg_small_valid3(self):

        s = "the teacher gave the lecture"
        #s = "the the teacher gave the lecture"
        #s = "teacher the gave the lecture"

        rules = [
            ('S', ['NP', 'VP']),
            ('NP', ['DT', 'NN']),
            ('VP', ['VB', 'NP']),
            ('DT', ['the']),
            ('NN', ['teacher']),
            ('NN', ['lecture']),
            ('NN', ['student']),
            ('VB', ['gave']),
            ('VB', ['lecture']),
        ]

        expect_parse_tree = inspect.cleandoc("""
            (S
                (NP
                    (DT the)
                    (NN teacher)
                )
                (VP
                    (VB gave)
                    (NP
                        (DT the)
                        (NN lecture)
                    )
                )
            )""")
        expect_parse_tree = os.linesep.join([st for st in expect_parse_tree.splitlines() if st])
        expect_tree = Tree.from_string(expect_parse_tree)
        expect_parse_tree = expect_tree.pretty()

        cyk = Cyk(rules)
        cyk.parse_pcfg(s)

        print("\nActual PCFG: ")
        print(cyk.tree.pretty_pcgf(cyk.pcfg))

        print("\nActual CYK Rule Table: ")
        print(cyk.table_rules)
        print("\nActual CYK Probability Table: ")
        print(cyk.table_probs)

        print("\nExpected Parse Tree: ")
        print(expect_parse_tree)
        print("\nActual Parse Tree: ")
        print(cyk.parse_tree)

        eq_(cyk.valid, True)
        eq_(cyk.parse_tree, expect_parse_tree)
Esempio n. 2
0
    def test_cyk_parse_small_valid2(self):

        s = "the teacher will lecture today in the lecture hall"
        #s = "the teacher gave the lecture"
        #s = "the the teacher gave the lecture"
        #s = "teacher the gave the lecture"

        str_tree1 = inspect.cleandoc("""
            (TOP
                (NP
                  (DT the)
                  (NN teacher)
                )
                (VP
                  (MD will)
                  (VP
                    (VB lecture)
                    (NP
                      (NN today)
                      (PP
                          (IN in)
                          (NP
                            (DT the)
                            (NN lecture)
                            (NN hall)
                          )
                      )
                    )
                  )
                )
                (. .)
            )""")
        tree1 = Tree.from_string(str_tree1)

        rules = []
        t1_col = Tree.collapse_unary(tree1)
        t1_cnf = Tree.chomsky_normal_form(t1_col)
        rules += Tree.productions(t1_cnf)

        print("PCFG: ")
        cyk = Cyk(rules)
        print(cyk.tree.pretty_pcgf(cyk.pcfg))
        cyk.parse(s)

        print("Actual Parse Tree: ")
        print(cyk.parse_tree)

        print("CYK Table: ")
        print(cyk.table_rules)
Esempio n. 3
0
    def test_cyk_parse_small(self):

        # rules = [
        #     ('S', ['NP', 'VP', '.']),
        #     ('NP', ['DET', 'N']),
        #     ('NP', ['NP', 'PP']),
        #     ('PP', ['P', 'NP']),
        #     ('VP', ['VP', 'PP']),
        #     ('VP', ['saw']),
        #     ('DET', ['the']),
        #     ('NP', ['I']),
        #     ('N', ['man']),
        #     ('N', ['telescope']),
        #     ('P', ['with']),
        #     ('V', ['saw']),
        #     ('N', ['cat']),
        #     ('N', ['dog']),
        #     ('N', ['pig']),
        #     ('N', ['hill']),
        #     ('N', ['park']),
        #     ('N', ['roof']),
        #     ('P', ['from']),
        #     ('P', ['on']),
        #     ('P', ['in'])
        # ]

        rules = [
            ('S', ['NP', 'VP']),
            ('NP', ['DT', 'NN']),
            ('VP', ['VB', 'NP']),
            ('DT', ['the']),
            ('NN', ['teacher']),
            ('NN', ['lecture']),
            ('VB', ['gave']),
        ]

        cyk = Cyk(rules)
        pcfg = cyk.tree.convert_to_pcfg(rules)
        #cyk.rules =
        cyk.pcfg = pcfg
        pcfg_pretty = cyk.tree.pretty_pcgf(pcfg)
        #actual = format(pcfg)
        print(pcfg_pretty)

        #sentence = "I saw the man with the telescope on the hill"
        #sentence = "I saw"
        sentence = "the teacher gave the lecture"

        cyk.parse(sentence)
Esempio n. 4
0
    def test_cyk_parse_small_valid3(self):

        s = "the lecture gave the teacher"
        #s = "the the teacher gave the lecture"
        #s = "teacher the gave the lecture"

        rules = [
            ('S', ['NP', 'VP']),
            ('NP', ['DT', 'NN']),
            ('VP', ['VB', 'NP']),
            ('DT', ['the']),
            ('NN', ['teacher']),
            ('NN', ['lecture']),
            ('VB', ['gave']),
        ]

        print("Expected Parse Tree: ")
        expect_parse_tree = inspect.cleandoc("""
            (S
                (NP
                    (DT the)
                    (NN lecture)
                )
                (VP
                    (VB gave)
                    (NP
                        (DT the)
                        (NN teacher)
                    )
                )
            )""")
        expect_parse_tree = os.linesep.join([st for st in expect_parse_tree.splitlines() if st])
        expect_tree = Tree.from_string(expect_parse_tree)
        expect_parse_tree = expect_tree.pretty()
        print(expect_parse_tree)

        cyk = Cyk(rules)
        #cyk.rules = rules
        cyk.parse(s)

        print("Actual Parse Tree: ")
        print(cyk.parse_tree)

        eq_(cyk.valid, True)
        eq_(cyk.parse_tree, expect_parse_tree)
Esempio n. 5
0
    def test_convert_to_pcfg_bigger_treebank2(self):
        cyk = Cyk()
        # filename = "wsj-normalized.psd"
        filename = "bigger_treebank_2.txt"

        actual_rules = cyk.tree.load_rules(filename)
        #actual_rules_pretty = Tree.pretty_productions(actual_rules)

        print('ACTUAL *************************')
        pcfg = cyk.tree.convert_to_pcfg(actual_rules)
        actual = cyk.tree.pretty_pcgf(pcfg)
        print(actual)
Esempio n. 6
0
    def test_cyk_parse_small_invalid3(self):

        #s = "the teacher gave the lecture"
        #s = "gave lecture the teacher the"
        #s = "the the teacher gave the lecture"
        s = "teacher the gave the lecture"

        rules = [
            ('S', ['NP', 'VP']),
            ('NP', ['DT', 'NN']),
            ('VP', ['VB', 'NP']),
            ('DT', ['the']),
            ('NN', ['teacher']),
            ('NN', ['lecture']),
            ('VB', ['gave']),
        ]

        cyk = Cyk(rules)
        cyk.parse(s)

        eq_(cyk.valid, False)
        eq_(cyk.parse_tree, '')
Esempio n. 7
0
    def test_cyk_parse_pcfg_small_valid1_jm(self):

        s = "the teacher gave the lecture"
        #s = "the the teacher gave the lecture"
        #s = "teacher the gave the lecture"

        str_tree1 = inspect.cleandoc("""
            (S
                (NP
                  (DT the)
                  (NN teacher)
                )
                (VP
                  (VB gave)
                  (NP
                    (DT the)
                    (NN lecture)
                  )
                )
            )""")
        tree1 = Tree.from_string(str_tree1)

        trees = []
        trees.append(tree1)

        rules = Cyk.load_rules(trees)
        cyk = Cyk(rules)
        cyk.parse_pcfg_jm(s)

        # expect_parse_tree = inspect.cleandoc("""
        #     (S
        #         (NP
        #             (DT the)
        #             (NN teacher)
        #         )
        #         (VP
        #             (VB gave)
        #             (NP
        #                 (DT the)
        #                 (NN lecture)
        #             )
        #         )
        #     )""")
        # expect_parse_tree = os.linesep.join([st for st in expect_parse_tree.splitlines() if st])
        # expect_tree = Tree.from_string(expect_parse_tree)
        # expect_parse_tree = expect_tree.pretty()
        #
        # print("\nActual PCFG: ")
        # print(cyk.tree.pretty_pcgf(cyk.pcfg))
        #
        # print("\nActual CYK Rule Table: ")
        # print(cyk.table_rules)
        # print("\nActual CYK Probability Table: ")
        # print(cyk.table_probs)
        #
        # print("\nExpected Parse Tree: ")
        # print(expect_parse_tree)
        # print("\nActual Parse Tree: ")
        # print(cyk.parse_tree)
        #
        # eq_(cyk.valid, True)
        # eq_(cyk.parse_tree, expect_parse_tree)
Esempio n. 8
0
    def test_cyk_parse_pcfg_small_valid4(self):

        s = "the teacher will lecture today in the lecture hall"
        #s = "the teacher gave the lecture"
        #s = "the the teacher gave the lecture"
        #s = "teacher the gave the lecture"

        str_tree1 = inspect.cleandoc("""
            (TOP
                (NP
                  (DT the)
                  (NN teacher)
                )
                (VP
                  (MD will)
                  (VP
                    (VB lecture)
                    (NP
                      (NN today)
                      (PP
                          (IN in)
                          (NP
                            (DT the)
                            (NN lecture)
                            (NN hall)
                          )
                      )
                    )
                  )
                )
                (. .)
            )""")
        str_tree2 = inspect.cleandoc("""
           (TOP
                (NP
                  (DT the)
                  (NN teacher)
                )
                (VP
                  (VB gave)

                  (NP
                    (DT the)
                    (NN teacher)
                  )
                )
            )""")
        tree1 = Tree.from_string(str_tree1)
        tree2 = Tree.from_string(str_tree2)

        rules = []
        t1_col = Tree.collapse_unary(tree1)
        t1_cnf = Tree.chomsky_normal_form(t1_col)
        rules += Tree.productions(t1_cnf)
        t2_col = Tree.collapse_unary(tree2)
        t2_cnf = Tree.chomsky_normal_form(t2_col)
        rules += Tree.productions(t2_cnf)

        print("PCFG: ")
        cyk = Cyk(rules)
        print(cyk.tree.pretty_pcgf(cyk.pcfg))
        cyk.parse_pcfg(s)

        print("\nActual PCFG: ")
        print(cyk.tree.pretty_pcgf(cyk.pcfg))

        print("\nActual CYK Rule Table: ")
        print(cyk.table_rules)
        print("\nActual CYK Probability Table: ")
        print(cyk.table_rules)

        # print("\nExpected Parse Tree: ")
        # print(expect_parse_tree)
        # print("\nActual Parse Tree: ")
        # print(cyk.parse_tree)

        eq_(cyk.valid, True)
Esempio n. 9
0
    def test_cyk_parse_pcfg_small_valid2(self):

        s = "the teacher will lecture today in the lecture hall"
        #s = "the teacher gave the lecture"
        #s = "the teacher gave the lecture"
        #s = "the the teacher gave the lecture"
        #s = "teacher the gave the lecture"

        str_tree1 = inspect.cleandoc("""
            (TOP
                (NP
                  (DT the)
                  (NN teacher)
                )
                (VP
                  (VB gave)
                  (NP
                    (DT the)
                    (NN lecture)
                  )
                )
            )""")
        tree1 = Tree.from_string(str_tree1)

        str_tree2 = inspect.cleandoc("""
            (TOP
                (NP
                  (DT the)
                  (NN teacher)
                )
                (VP
                  (MD will)
                  (VP
                    (VB lecture)
                    (NP
                      (NN today)
                      (PP
                          (IN in)
                          (NP
                            (DT the)
                            (NN lecture)
                            (NN hall)
                          )
                      )
                    )
                  )
                )
                (. .)
            )""")
        tree2 = Tree.from_string(str_tree2)

        trees = []
        trees.append(tree1)
        trees.append(tree2)

        rules = Cyk.load_rules(trees)
        cyk = Cyk(rules)
        print("\nActual PCFG: ")
        print(cyk.tree.pretty_pcgf(cyk.pcfg))
        cyk.parse_pcfg(s)
        #cyk.parse(s)

        print("Expected PCFG: ")
        print("What is the expected PCFG")
        #print(cyk.tree.pretty_pcgf(cyk.pcfg))

        print("\nActual CYK Rule Table: ")
        print(cyk.table_rules)
        print("\nActual CYK Probability Table: ")
        print(cyk.parse_tree)
        print("\nActual Parse Tree: ")
        print(cyk.parse_tree)

        # print("\nExpected Parse Tree: ")
        # print(expect_parse_tree)

        eq_(cyk.valid, True)
Esempio n. 10
0
    def test_convert_to_pcfg_inline1(self):
        cyk = Cyk()

        #cyk.rules = cyk.load_rules('')
        s = inspect.cleandoc("""
            (TOP
                (NP
                  (DT the)
                  (NN teacher)
                )
                (VP
                  (MD will)
                  (VP
                    (VB lecture)
                    (NP
                      (NN today)
                      (PP
                          (IN in)
                          (NP
                            (DT the)
                            (NN lecture)
                            (NN hall)
                          )
                      )
                    )
                  )
                )
                (. .)
            )""")

        t_before = cyk.tree.from_string(s)

        print('BEFORE: *************************')
        before = t_before.pretty()
        print(before)

        # counts['NP'][('DT','NN')] / sum(counts['NP'].values())
        print('EXPECTED: *************************')

        # blah = {'TOP': {('NP', 'VP', '.'): 1}, 'NP': {('DT', 'NN'): 1, ('NN', 'PP'): 1, ('DT', 'NN', 'NN'): 1}, 'DT': {('the',): 1}, 'NN': {('teacher',): 1, ('today',): 1, ('lecture',): 1, ('hall',): 1}, 'VP': {('MD', 'VP'): 1, ('VB', 'NP'): 1}, 'MD': {('will',): 1}, 'VB': {('lecture',): 1}, 'PP': {('IN', 'NP'): 1}, 'IN': {('in',): 1}, '.': {('.',): 1}}
        pcfg_expect = {
            'TOP': {
                ('NP', 'VP', '.'): 1.0
            },
            'NP': {
                ('DT', 'NN'): 0.3333333333333333,
                ('NN', 'PP'): 0.3333333333333333,
                ('DT', 'NN', 'NN'): 0.3333333333333333,
            },
            'DT': {
                ('the',): 1.0
            },
            'NN': {
                ('teacher',): 0.25,
                ('today',): 0.25,
                ('lecture',): 0.25,
                ('hall',): 0.25,
            },
            'VP': {
                ('MD', 'VP'): 0.5,
                ('VB', 'NP'): 0.5,
            },
            'MD': {
                ('will',): 1.0
            },
            'VB': {
                ('lecture',): 1.0
            },
            'PP': {
                ('IN', 'NP'): 1.0
            },
            'IN': {
                ('in',): 1.0
            },
            '.': {
                ('.',): 1.0
            }
        }
        #expect = format(pcgf_expect)
        expect = "defaultdict(<class 'dict'>, " + format(pcfg_expect) + ")"
        print(expect)

        print('ACTUAL *************************')
        rules = cyk.tree.productions(t_before)
        pcfg_actual = cyk.tree.convert_to_pcfg(rules)
        actual = format(pcfg_actual)
        print(actual)

        eq_(actual, expect)