• 设为首页
  • 点击收藏
  • 手机版
    手机扫一扫访问
    迪恩网络手机版
  • 关注官方公众号
    微信扫一扫关注
    迪恩网络公众号
登陆 注册
描述文字

Python tgrep.tgrep_positions函数代码示例

原作者: [db:作者] 来自: [db:来源] 收藏 邀请

本文整理汇总了Python中nltk.tgrep.tgrep_positions函数的典型用法代码示例。如果您正苦于以下问题：Python tgrep_positions函数的具体用法？Python tgrep_positions怎么用？Python tgrep_positions使用的例子？那么恭喜您, 这里精选的函数代码示例或许可以为您提供帮助。



在下文中一共展示了tgrep_positions函数的20个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于我们的系统推荐出更棒的Python代码示例。

示例1: test_use_macros

 def test_use_macros(self):
     '''
     Test defining and using tgrep2 macros.
     '''
     tree = ParentedTree.fromstring(
         '(VP (VB sold) (NP (DET the) '
         '(NN heiress)) (NP (NN deed) (PREP to) '
         '(NP (DET the) (NN school) (NN house))))'
     )
     self.assertEqual(
         list(
             tgrep.tgrep_positions(
                 '@ NP /^NP/;\[email protected] NN /^NN/;\[email protected] !< @NP !$.. @NN', [tree]
             )
         ),
         [[(1,), (2, 2)]],
     )
     # use undefined macro @CNP
     self.assertRaises(
         tgrep.TgrepException,
         list,
         tgrep.tgrep_positions(
             '@ NP /^NP/;\[email protected] NN /^NN/;\[email protected] !< @NP !$.. @NN', [tree]
         ),
     )
开发者ID:rmalouf，项目名称:nltk，代码行数:25，代码来源:test_tgrep.py


示例2: test_node_nocase

 def test_node_nocase(self):
     '''
     Test selecting nodes using case insensitive node names.
     '''
     tree = ParentedTree.fromstring('(S (n x) (N x))')
     self.assertEqual(list(tgrep.tgrep_positions('"N"', [tree])), [[(1,)]])
     self.assertEqual(list(tgrep.tgrep_positions('[email protected]"N"', [tree])), [[(0,), (1,)]])
开发者ID:DrDub，项目名称:nltk，代码行数:7，代码来源:test_tgrep.py


示例3: test_node_printing

 def test_node_printing(self):
     '''Test that the tgrep print operator ' is properly ignored.'''
     tree = ParentedTree.fromstring('(S (n x) (N x))')
     self.assertEqual(list(tgrep.tgrep_positions('N', [tree])),
                      list(tgrep.tgrep_positions('\'N', [tree])))
     self.assertEqual(list(tgrep.tgrep_positions('/[Nn]/', [tree])),
                      list(tgrep.tgrep_positions('\'/[Nn]/', [tree])))
开发者ID:DrDub，项目名称:nltk，代码行数:7，代码来源:test_tgrep.py


示例4: test_labeled_nodes

    def test_labeled_nodes(self):
        '''
        Test labeled nodes.

        Test case from Emily M. Bender.
        '''
        search = '''
            # macros
            @ SBJ /SBJ/;
            @ VP /VP/;
            @ VB /VB/;
            @ VPoB /V[PB]/;
            @ OBJ /OBJ/;

            # 1 svo
            S < @SBJ=s < (@VP=v < (@VB $.. @OBJ)) : =s .. =v'''
        sent1 = ParentedTree.fromstring(
            '(S (NP-SBJ I) (VP (VB eat) (NP-OBJ (NNS apples))))')
        sent2 = ParentedTree.fromstring(
            '(S (VP (VB eat) (NP-OBJ (NNS apples))) (NP-SBJ I))')
        search_firsthalf = (search.split('\n\n')[0] +
                            'S < @SBJ < (@VP < (@VB $.. @OBJ))')
        search_rewrite = 'S < (/.*SBJ/ $.. (/VP/ < (/VB/ $.. /.*OBJ/)))'

        self.assertTrue(list(tgrep.tgrep_positions(search_firsthalf, [sent1]))[0])
        self.assertTrue(list(tgrep.tgrep_positions(search, [sent1]))[0])
        self.assertTrue(list(tgrep.tgrep_positions(search_rewrite, [sent1]))[0])
        self.assertEqual(list(tgrep.tgrep_positions(search, [sent1])),
                         list(tgrep.tgrep_positions(search_rewrite, [sent1])))
        self.assertTrue(list(tgrep.tgrep_positions(search_firsthalf, [sent2]))[0])
        self.assertFalse(list(tgrep.tgrep_positions(search, [sent2]))[0])
        self.assertFalse(list(tgrep.tgrep_positions(search_rewrite, [sent2]))[0])
        self.assertEqual(list(tgrep.tgrep_positions(search, [sent2])),
                         list(tgrep.tgrep_positions(search_rewrite, [sent2])))
开发者ID:DrDub，项目名称:nltk，代码行数:34，代码来源:test_tgrep.py


示例5: test_node_noleaves

 def test_node_noleaves(self):
     '''
     Test node name matching with the search_leaves flag set to False.
     '''
     tree = ParentedTree.fromstring('(S (A (T x)) (B (N x)))')
     self.assertEqual(list(tgrep.tgrep_positions('x', [tree])),
                      [[(0, 0, 0), (1, 0, 0)]])
     self.assertEqual(list(tgrep.tgrep_positions('x', [tree], False)),
                      [[]])
开发者ID:DrDub，项目名称:nltk，代码行数:9，代码来源:test_tgrep.py


示例6: test_node_quoted

 def test_node_quoted(self):
     '''
     Test selecting nodes using quoted node names.
     '''
     tree = ParentedTree.fromstring('(N ("N" x) (N" x) ("\\" x))')
     self.assertEqual(list(tgrep.tgrep_positions('"N"', [tree])), [[()]])
     self.assertEqual(list(tgrep.tgrep_positions('"\\"N\\""', [tree])), [[(0,)]])
     self.assertEqual(list(tgrep.tgrep_positions('"N\\""', [tree])), [[(1,)]])
     self.assertEqual(list(tgrep.tgrep_positions('"\\"\\\\\\""', [tree])), [[(2,)]])
开发者ID:DrDub，项目名称:nltk，代码行数:9，代码来源:test_tgrep.py


示例7: test_rel_sister_nodes

 def test_rel_sister_nodes(self):
     '''
     Test matching sister nodes in a tree.
     '''
     tree = ParentedTree.fromstring('(S (A x) (B x) (C x))')
     self.assertEqual(list(tgrep.tgrep_positions('* $. B', [tree])),  [[(0,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* $.. B', [tree])), [[(0,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* $, B', [tree])),  [[(2,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* $,, B', [tree])), [[(2,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* $ B', [tree])),   [[(0,), (2,)]])
开发者ID:DrDub，项目名称:nltk，代码行数:10，代码来源:test_tgrep.py


示例8: test_node_regex_2

 def test_node_regex_2(self):
     '''
     Test regex matching on nodes.
     '''
     tree = ParentedTree.fromstring('(S (SBJ x) (SBJ1 x) (NP-SBJ x))')
     self.assertEqual(list(tgrep.tgrep_positions('/^SBJ/', [tree])),
                      [[(0,), (1,)]])
     # This is a regular expression that matches any node whose
     # name includes SBJ, including NP-SBJ:
     self.assertEqual(list(tgrep.tgrep_positions('/SBJ/', [tree])),
                      [[(0,), (1,), (2,)]])
开发者ID:DrDub，项目名称:nltk，代码行数:11，代码来源:test_tgrep.py


示例9: test_trailing_semicolon

 def test_trailing_semicolon(self):
     '''
     Test that semicolons at the end of a tgrep2 search string won't
     cause a parse failure.
     '''
     tree = ParentedTree.fromstring(
         '(S (NP (DT the) (JJ big) (NN dog)) ' '(VP bit) (NP (DT a) (NN cat)))'
     )
     self.assertEqual(list(tgrep.tgrep_positions('NN', [tree])), [[(0, 2), (2, 1)]])
     self.assertEqual(list(tgrep.tgrep_positions('NN;', [tree])), [[(0, 2), (2, 1)]])
     self.assertEqual(
         list(tgrep.tgrep_positions('NN;;', [tree])), [[(0, 2), (2, 1)]]
     )
开发者ID:rmalouf，项目名称:nltk，代码行数:13，代码来源:test_tgrep.py


示例10: test_multiple_conjs

 def test_multiple_conjs(self):
     '''
     Test that multiple (3 or more) conjunctions of node relations are
     handled properly.
     '''
     sent = ParentedTree.fromstring(
         '((A (B b) (C c)) (A (B b) (C c) (D d)))')
     # search = '(A < B < C < D)'
     # search_tworels = '(A < B < C)'
     self.assertEqual(list(tgrep.tgrep_positions('(A < B < C < D)', [sent])),
                      [[(1,)]])
     self.assertEqual(list(tgrep.tgrep_positions('(A < B < C)', [sent])),
                      [[(0,), (1,)]])
开发者ID:DrDub，项目名称:nltk，代码行数:13，代码来源:test_tgrep.py


示例11: test_node_simple

 def test_node_simple(self):
     '''
     Test a simple use of tgrep for finding nodes matching a given
     pattern.
     '''
     tree = ParentedTree.fromstring(
         '(S (NP (DT the) (JJ big) (NN dog)) '
         '(VP bit) (NP (DT a) (NN cat)))')
     self.assertEqual(list(tgrep.tgrep_positions('NN', [tree])),
                      [[(0,2), (2,1)]])
     self.assertEqual(list(tgrep.tgrep_nodes('NN', [tree])),
                      [[tree[0,2], tree[2,1]]])
     self.assertEqual(list(tgrep.tgrep_positions('NN|JJ', [tree])),
                      [[(0, 1), (0, 2), (2, 1)]])
开发者ID:DrDub，项目名称:nltk，代码行数:14，代码来源:test_tgrep.py


示例12: test_rel_precedence

 def test_rel_precedence(self):
     '''
     Test matching nodes based on precedence relations.
     '''
     tree = ParentedTree.fromstring('(S (NP (NP (PP x)) (NP (AP x)))'
                                    ' (VP (AP (X (PP x)) (Y (AP x))))'
                                    ' (NP (RC (NP (AP x)))))')
     self.assertEqual(list(tgrep.tgrep_positions('* . X', [tree])),
                      [[(0,), (0, 1), (0, 1, 0)]])
     self.assertEqual(list(tgrep.tgrep_positions('* . Y', [tree])),
                      [[(1, 0, 0), (1, 0, 0, 0)]])
     self.assertEqual(list(tgrep.tgrep_positions('* .. X', [tree])),
                      [[(0,), (0, 0), (0, 0, 0), (0, 1), (0, 1, 0)]])
     self.assertEqual(list(tgrep.tgrep_positions('* .. Y', [tree])),
                      [[(0,), (0, 0), (0, 0, 0), (0, 1), (0, 1, 0),
                       (1, 0, 0), (1, 0, 0, 0)]])
     self.assertEqual(list(tgrep.tgrep_positions('* , X', [tree])),
                      [[(1, 0, 1), (1, 0, 1, 0)]])
     self.assertEqual(list(tgrep.tgrep_positions('* , Y', [tree])),
                      [[(2,), (2, 0), (2, 0, 0), (2, 0, 0, 0)]])
     self.assertEqual(list(tgrep.tgrep_positions('* ,, X', [tree])),
                      [[(1, 0, 1), (1, 0, 1, 0), (2,), (2, 0), (2, 0, 0),
                       (2, 0, 0, 0)]])
     self.assertEqual(list(tgrep.tgrep_positions('* ,, Y', [tree])),
                      [[(2,), (2, 0), (2, 0, 0), (2, 0, 0, 0)]])
开发者ID:DrDub，项目名称:nltk，代码行数:25，代码来源:test_tgrep.py


示例13: test_node_encoding

 def test_node_encoding(self):
     '''
     Test that tgrep search strings handles bytes and strs the same
     way.
     '''
     tree = ParentedTree.fromstring(
         '(S (NP (DT the) (JJ big) (NN dog)) '
         '(VP bit) (NP (DT a) (NN cat)))')
     self.assertEqual(list(tgrep.tgrep_positions(b('NN'), [tree])),
                      list(tgrep.tgrep_positions('NN', [tree])))
     self.assertEqual(list(tgrep.tgrep_nodes(b('NN'), [tree])),
                      list(tgrep.tgrep_nodes('NN', [tree])))
     self.assertEqual(list(tgrep.tgrep_positions(b('NN|JJ'), [tree])),
                      list(tgrep.tgrep_positions('NN|JJ', [tree])))
开发者ID:DrDub，项目名称:nltk，代码行数:14，代码来源:test_tgrep.py


示例14: test_node_regex

 def test_node_regex(self):
     '''
     Test regex matching on nodes.
     '''
     tree = ParentedTree.fromstring('(S (NP-SBJ x) (NP x) (NNP x) (VP x))')
     # This is a regular expression that matches any node whose
     # name starts with NP, including NP-SBJ:
     self.assertEqual(list(tgrep.tgrep_positions('/^NP/', [tree])), [[(0,), (1,)]])
开发者ID:rmalouf，项目名称:nltk，代码行数:8，代码来源:test_tgrep.py


示例15: test_bad_operator

 def test_bad_operator(self):
     '''
     Test error handling of undefined tgrep operators.
     '''
     tree = ParentedTree.fromstring('(S (A (T x)) (B (N x)))')
     self.assertRaises(
         tgrep.TgrepException, list, tgrep.tgrep_positions('* >>> S', [tree])
     )
开发者ID:rmalouf，项目名称:nltk，代码行数:8，代码来源:test_tgrep.py


示例16: test_comments

    def test_comments(self):
        '''
        Test that comments are correctly filtered out of tgrep search
        strings.
        '''
        tree = ParentedTree.fromstring('(S (NN x) (NP x) (NN x))')
        search1 = '''
        @ NP /^NP/;
        @ NN /^NN/;
        @NN
        '''
        self.assertEqual(list(tgrep.tgrep_positions(search1, [tree])), [[(0,), (2,)]])
        search2 = '''
        # macros
        @ NP /^NP/;
        @ NN /^NN/;

        # search string
        @NN
        '''
        self.assertEqual(list(tgrep.tgrep_positions(search2, [tree])), [[(0,), (2,)]])
开发者ID:rmalouf，项目名称:nltk，代码行数:21，代码来源:test_tgrep.py


示例17: test_node_tree_position

 def test_node_tree_position(self):
     '''
     Test matching on nodes based on NLTK tree position.
     '''
     tree = ParentedTree.fromstring('(S (NP-SBJ x) (NP x) (NNP x) (VP x))')
     # test all tree positions that are not leaves
     leaf_positions = set([tree.leaf_treeposition(x)
                           for x in range(len(tree.leaves()))])
     tree_positions = [x for x in tree.treepositions()
                       if x not in leaf_positions]
     for position in tree_positions:
         node_id = 'N{0}'.format(position)
         tgrep_positions = list(tgrep.tgrep_positions(node_id, [tree]))
         self.assertEqual(len(tgrep_positions[0]), 1)
         self.assertEqual(tgrep_positions[0][0], position)
开发者ID:DrDub，项目名称:nltk，代码行数:15，代码来源:test_tgrep.py


示例18: test_examples

    def test_examples(self):
        '''
        Test the Basic Examples from the TGrep2 manual.
        '''
        tree = ParentedTree.fromstring('(S (NP (AP x)) (NP (PP x)))')
        # This matches any NP node that immediately dominates a PP:
        self.assertEqual(list(tgrep.tgrep_positions('NP < PP', [tree])),
                         [[(1,)]])

        tree = ParentedTree.fromstring('(S (NP x) (VP x) (NP (PP x)) (VP x))')
        # This matches an NP that dominates a PP and is immediately
        # followed by a VP:
        self.assertEqual(list(tgrep.tgrep_positions('NP << PP . VP', [tree])),
                         [[(2,)]])

        tree = ParentedTree.fromstring('(S (NP (AP x)) (NP (PP x)) '
                                       '(NP (DET x) (NN x)) (VP x))')
        # This matches an NP that dominates a PP or is immediately
        # followed by a VP:
        self.assertEqual(list(tgrep.tgrep_positions('NP << PP | . VP', [tree])),
                         [[(1,), (2,)]])

        tree = ParentedTree.fromstring('(S (NP (NP (PP x)) (NP (AP x)))'
                                       ' (VP (AP (NP (PP x)) (NP (AP x))))'
                                       ' (NP (RC (NP (AP x)))))')
        # This matches an NP that does not dominate a PP. Also, the NP
        # must either have a parent that is an NP or be dominated by a
        # VP:
        self.assertEqual(list(tgrep.tgrep_positions(
                                               'NP !<< PP [> NP | >> VP]', [tree])),
                         [[(0, 1), (1, 0, 1)]])

        tree = ParentedTree.fromstring('(S (NP (AP (PP x) (VP x))) '
                                       '(NP (AP (PP x) (NP x))) (NP x))')
        # This matches an NP that dominates a PP which itself is
        # immediately followed by a VP. Note the use of parentheses to
        # group ". VP" with the PP rather than with the NP:
        self.assertEqual(list(tgrep.tgrep_positions('NP << (PP . VP)', [tree])),
                         [[(0,)]])

        tree = ParentedTree.fromstring(
            '(S (NP (DET a) (NN cat) (PP (IN on) (NP x)))'
            ' (NP (DET a) (NN cat) (PP (IN on) (NP x)) (PP x))'
            ' (NP x))')
        # This matches an NP whose last child is a PP that begins with
        # the preposition "on":
        self.assertEqual(list(tgrep.tgrep_positions(
                                               'NP <\' (PP <, (IN < on))', [tree])),
                         [[(0,)]])

        tree = ParentedTree.fromstring(
            '(S (S (C x) (A (B x))) (S (C x) (A x)) '
            '(S (D x) (A (B x))))')
        # The following pattern matches an S which has a child A and
        # another child that is a C and that the A has a child B:
        self.assertEqual(list(tgrep.tgrep_positions('S < (A < B) < C', [tree])),
                         [[(0,)]])

        tree = ParentedTree.fromstring(
            '(S (S (A (B x) (C x))) (S (S (C x) (A (B x)))))')
        # However, this pattern means that S has child A and that A
        # has children B and C:
        self.assertEqual(list(tgrep.tgrep_positions('S < ((A < B) < C)', [tree])),
                         [[(0,)]])

        # It is equivalent to this:
        self.assertEqual(list(tgrep.tgrep_positions('S < (A < B < C)', [tree])),
                         [[(0,)]])
开发者ID:DrDub，项目名称:nltk，代码行数:68，代码来源:test_tgrep.py


示例19: tests_rel_indexed_children

 def tests_rel_indexed_children(self):
     '''
     Test matching nodes based on their index in their parent node.
     '''
     tree = ParentedTree.fromstring('(S (A x) (B x) (C x))')
     self.assertEqual(list(tgrep.tgrep_positions('* >, S', [tree])),   [[(0,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* >1 S', [tree])),   [[(0,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* >2 S', [tree])),   [[(1,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* >3 S', [tree])),   [[(2,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* >\' S', [tree])),  [[(2,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* >-1 S', [tree])),  [[(2,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* >-2 S', [tree])),  [[(1,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* >-3 S', [tree])),  [[(0,)]])
     tree = ParentedTree.fromstring(
         '(S (D (A x) (B x) (C x)) (E (B x) (C x) (A x)) '
         '(F (C x) (A x) (B x)))')
     self.assertEqual(list(tgrep.tgrep_positions('* <, A', [tree])),   [[(0,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* <1 A', [tree])),   [[(0,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* <2 A', [tree])),   [[(2,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* <3 A', [tree])),   [[(1,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* <\' A', [tree])),  [[(1,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* <-1 A', [tree])),  [[(1,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* <-2 A', [tree])),  [[(2,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* <-3 A', [tree])),  [[(0,)]])
开发者ID:DrDub，项目名称:nltk，代码行数:24，代码来源:test_tgrep.py


示例20: tests_rel_dominance

 def tests_rel_dominance(self):
     '''
     Test matching nodes based on dominance relations.
     '''
     tree = ParentedTree.fromstring('(S (A (T x)) (B (N x)))')
     self.assertEqual(list(tgrep.tgrep_positions('* < T', [tree])),
                      [[(0,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* < T > S', [tree])),
                      [[(0,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* !< T', [tree])),
                      [[(), (0, 0), (0, 0, 0), (1,), (1, 0), (1, 0, 0)]])
     self.assertEqual(list(tgrep.tgrep_positions('* !< T > S', [tree])),
                      [[(1,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* > A', [tree])),
                      [[(0, 0)]])
     self.assertEqual(list(tgrep.tgrep_positions('* > B', [tree])),
                      [[(1, 0)]])
     self.assertEqual(list(tgrep.tgrep_positions('* !> B', [tree])),
                      [[(), (0,), (0, 0), (0, 0, 0), (1,), (1, 0, 0)]])
     self.assertEqual(list(tgrep.tgrep_positions('* !> B >> S', [tree])),
                      [[(0,), (0, 0), (1,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* >> S', [tree])),
                      [[(0,), (0, 0), (1,), (1, 0)]])
     self.assertEqual(list(tgrep.tgrep_positions('* >>, S', [tree])),
                      [[(0,), (0, 0)]])
     self.assertEqual(list(tgrep.tgrep_positions('* >>\' S', [tree])),
                      [[(1,), (1, 0)]])
     # Known issue:
     #self.assertEqual(list(tgrep.tgrep_positions('* !>> S', [tree])),
     #                 [[()]])
     self.assertEqual(list(tgrep.tgrep_positions('* << T', [tree])),
                      [[(), (0,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* <<\' T', [tree])),
                      [[(0,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* <<1 N', [tree])),
                      [[(1,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* !<< T', [tree])),
                      [[(0, 0), (0, 0, 0), (1,), (1, 0), (1, 0, 0)]])
     tree = ParentedTree.fromstring('(S (A (T x)) (B (T x) (N x )))')
     self.assertEqual(list(tgrep.tgrep_positions('* <: T', [tree])),
                      [[(0,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* < T', [tree])),
                      [[(0,), (1,)]])
     self.assertEqual(list(tgrep.tgrep_positions('* !<: T', [tree])),
                      [[(), (0, 0), (0, 0, 0), (1,), (1, 0), (1, 0, 0),
                       (1, 1), (1, 1, 0)]])
     self.assertEqual(list(tgrep.tgrep_positions('* !<: T > S', [tree])),
                      [[(1,)]])
     tree = ParentedTree.fromstring('(S (T (A x) (B x)) (T (C x)))')
     self.assertEqual(list(tgrep.tgrep_positions('* >: T', [tree])),
                      [[(1, 0)]])
     self.assertEqual(list(tgrep.tgrep_positions('* !>: T', [tree])),
                      [[(), (0,), (0, 0), (0, 0, 0), (0, 1), (0, 1, 0),
                       (1,), (1, 0, 0)]])
     tree = ParentedTree.fromstring('(S (A (B (C (D (E (T x))))))'
                                    ' (A (B (C (D (E (T x))) (N x)))))')
     self.assertEqual(list(tgrep.tgrep_positions('* <<: T', [tree])),
                      [[(0,), (0, 0), (0, 0, 0), (0, 0, 0, 0),
                       (0, 0, 0, 0, 0), (1, 0, 0, 0), (1, 0, 0, 0, 0)]])
     self.assertEqual(list(tgrep.tgrep_positions('* >>: A', [tree])),
                      [[(0, 0), (0, 0, 0), (0, 0, 0, 0), (0, 0, 0, 0, 0),
                       (0, 0, 0, 0, 0, 0), (1, 0), (1, 0, 0)]])
开发者ID:DrDub，项目名称:nltk，代码行数:62，代码来源:test_tgrep.py



注：本文中的nltk.tgrep.tgrep_positions函数示例由纯净天空整理自Github/MSDocs等源码及文档管理平台，相关代码片段筛选自各路编程大神贡献的开源项目，源码版权归原作者所有，传播和使用请参考对应项目的License；未经允许，请勿转载。

鲜花
握手
雷人
路过
鸡蛋
该文章已有0人参与评论

请发表评论

全部评论

专题导读
More+
上一篇：
Python tgrep.tgrep_tokenize函数代码示例发布时间：2022-05-27
下一篇：
Python stanford.POSTagger类代码示例发布时间：2022-05-27
热门推荐
More+
热门话题
More+
阅读排行榜

扫描微信二维码

查看手机版网站

随时了解更新最新资讯

139-2527-9053

在线客服（服务时间 9:00～18:00）

在线QQ客服
地址：深圳市南山区西丽大学城创智工业园
电邮：jeky_zhao#qq.com
移动电话：139-2527-9053

Powered by 互联科技 X3.4© 2001-2213 极客世界.|Sitemap