메뉴 건너뛰기




Volumn , Issue , 2012, Pages 460-470

Efficient parsing with linear context-free rewriting systems

Author keywords

[No Author keywords available]

Indexed keywords

BINS; COMPUTATIONAL LINGUISTICS; CONTEXT FREE GRAMMARS; FORESTRY; FORMAL LANGUAGES; LINGUISTICS;

EID: 84977905510     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (19)

References (33)
  • 2
    • 0003408807 scopus 로고    scopus 로고
    • Proposal for a natural language processing syntactic backbone
    • INRIA-Rocquencourt, Le Chesnay, France. URL
    • Pierre Boullier. 1998. Proposal for a natural language processing syntactic backbone. Technical Report RR-3342, INRIA-Rocquencourt, Le Chesnay, France. URL http://www.inria.fr/RRRT/RR-3342.html.
    • (1998) Technical Report RR-3342
    • Boullier, P.1
  • 3
    • 79953806256 scopus 로고    scopus 로고
    • Discontinuity revisited: An improved conversion to context-free representations
    • Adriane Boyd. 2007. Discontinuity revisited: An improved conversion to context-free representations. In Proceedings of the Linguistic Annotation Workshop, pages 41-44.
    • (2007) Proceedings of the Linguistic Annotation Workshop , pp. 41-44
    • Boyd, A.1
  • 6
    • 84874593544 scopus 로고    scopus 로고
    • Unavoidable ill-nestedness in natural language and the adequacy of tree local-mctag induced dependency structures
    • Joan Chen-Main and Aravind K. Joshi. 2010. Unavoidable ill-nestedness in natural language and the adequacy of tree local-mctag induced dependency structures. In Proceedings of TAG+. URL http://www.research.att.com/-srini/TAG+10/papers/chenmainjoshi.pdf.
    • (2010) Proceedings of TAG+. URL
    • Chen-Main, J.1    Joshi, A.K.2
  • 8
    • 84859073833 scopus 로고    scopus 로고
    • Optimal head-driven parsing complexity for linear context-free rewriting systems
    • Pierluigi Crescenzi, Daniel Gildea, Aandrea Marino, Gianluca Rossi, and Giorgio Satta. 2011. Optimal head-driven parsing complexity for linear context-free rewriting systems. In Proc. of ACL.
    • (2011) Proc. of ACL.
    • Crescenzi, P.1    Gildea, D.2    Marino, A.3    Rossi, G.4    Satta, G.5
  • 9
    • 6344252167 scopus 로고    scopus 로고
    • Parsing German with sister-head dependencies
    • Amit Dubey and Frank Keller. 2003. Parsing German with sister-head dependencies. In Proc. of ACL, pages 96-103.
    • (2003) Proc. of ACL , pp. 96-103
    • Dubey, A.1    Keller, F.2
  • 10
    • 84872901721 scopus 로고    scopus 로고
    • PLCFRS parsing of English discontinuous constituents
    • Kilian Evang and Laura Kallmeyer. 2011. PLCFRS parsing of English discontinuous constituents. In Proceedings of IWPT, pages 104- 116.
    • (2011) Proceedings of IWPT , pp. 104-116
    • Evang, K.1    Kallmeyer, L.2
  • 11
    • 79952813252 scopus 로고    scopus 로고
    • Optimal parsing strategies for linear context-free rewriting systems
    • Daniel Gildea. 2010. Optimal parsing strategies for linear context-free rewriting systems. In Proceedings of NAACL HLT 2010., pages 769- 776.
    • (2010) Proceedings of NAACL HLT 2010 , pp. 769-776
    • Gildea, D.1
  • 12
    • 84858387792 scopus 로고    scopus 로고
    • Efficient parsing of wellnested linear context-free rewriting systems
    • Carlos Gómez-Rodríguez, Marco Kuhlmann, and Giorgio Satta. 2010. Efficient parsing of wellnested linear context-free rewriting systems. In Proceedings of NAACL HLT 2010., pages 276- 284.
    • (2010) Proceedings of NAACL HLT 2010 , pp. 276-284
    • Gómez-Rodríguez, C.1    Kuhlmann, M.2    Satta, G.3
  • 13
    • 84858414868 scopus 로고    scopus 로고
    • Optimal reduction of rule length in linear context-free rewriting systems
    • Carlos Gómez-Rodríguez, Marco Kuhlmann, Giorgio Satta, and David Weir. 2009. Optimal reduction of rule length in linear context-free rewriting systems. In Proceedings of NAACL HLT 2009, pages 539-547.
    • (2009) Proceedings of NAACL HLT , vol.2009 , pp. 539-547
    • Gómez-Rodríguez, C.1    Kuhlmann, M.2    Satta, G.3    Weir, D.4
  • 14
    • 44849114984 scopus 로고    scopus 로고
    • Efficient parsing of DOP with PCFG-reductions
    • Rens Bod, Remko Scha, and Khalil Sima'an, editors, The University of Chicago Press
    • Joshua Goodman. 2003. Efficient parsing of DOP with PCFG-reductions. In Rens Bod, Remko Scha, and Khalil Sima'an, editors, Data- Oriented Parsing. The University of Chicago Press.
    • (2003) Data- Oriented Parsing
    • Goodman, J.1
  • 18
    • 85146417759 scopus 로고    scopus 로고
    • Accurate unlexicalized parsing
    • Dan Klein and Christopher D. Manning. 2003. Accurate unlexicalized parsing. In Proc. of ACL, volume 1, pages 423-430.
    • (2003) Proc. of ACL , vol.1 , pp. 423-430
    • Klein, D.1    Manning, C.D.2
  • 19
    • 84891614320 scopus 로고    scopus 로고
    • Treebank grammar techniques for non-projective dependency parsing
    • Marco Kuhlmann and Giorgio Satta. 2009. Treebank grammar techniques for non-projective dependency parsing. In Proceedings of EACL, pages 478-486.
    • (2009) Proceedings of EACL , pp. 478-486
    • Kuhlmann, M.1    Satta, G.2
  • 22
    • 84888104443 scopus 로고    scopus 로고
    • Characterizing discontinuity in constituent treebanks
    • Springer
    • Wolfgang Maier and Timm Lichte. 2009. Characterizing discontinuity in constituent treebanks. In Proceedings of Formal Grammar 2009, pages 167-182. Springer.
    • (2009) Proceedings of Formal Grammar 2009 , pp. 167-182
    • Maier, W.1    Lichte, T.2
  • 24
    • 34249852033 scopus 로고
    • Building a large annotated corpus of english: The penn treebank
    • Mitchell P. Marcus, Mary Ann Marcinkiewicz, and Beatrice Santorini. 1993. Building a large annotated corpus of english: The penn treebank. Computational linguistics, 19(2):313-330.
    • (1993) Computational Linguistics , vol.19 , Issue.2 , pp. 313-330
    • Marcus, M.P.1    Marcinkiewicz, M.A.2    Santorini, B.3
  • 25
    • 84925980443 scopus 로고
    • Parentheticals and discontinuous constituent structure
    • James D. McCawley. 1982. Parentheticals and discontinuous constituent structure. Linguistic Inquiry, 13(1):91-106.
    • (1982) Linguistic Inquiry , vol.13 , Issue.1 , pp. 91-106
    • McCawley, J.D.1
  • 26
    • 80053388132 scopus 로고    scopus 로고
    • Computing the most probable parse for a discontinuous phrase structure grammar
    • Harry Bunt, John Carroll, and Giorgio Satta, editors, Kluwer Academic Publishers, Norwell, MA, USA
    • Oliver Plaehn. 2004. Computing the most probable parse for a discontinuous phrase structure grammar. In Harry Bunt, John Carroll, and Giorgio Satta, editors, New developments in parsing technology, pages 91-106. Kluwer Academic Publishers, Norwell, MA, USA.
    • (2004) New Developments in Parsing Technology , pp. 91-106
    • Plaehn, O.1
  • 27
    • 0348119272 scopus 로고
    • Language theory and language technology; competence and performance
    • Q.A.M. de Kort and G.L.J. Leerdam, editors, LVVN, Almere, the Netherlands. Original title: Taaltheorie en taaltechnologie; competence en performance. Translation available at
    • Remko Scha. 1990. Language theory and language technology; competence and performance. In Q.A.M. de Kort and G.L.J. Leerdam, editors, Computertoepassingen in de Neerlandistiek, pages 7-22. LVVN, Almere, the Netherlands. Original title: Taaltheorie en taaltechnologie; competence en performance. Translation available at http://iaaa.nl/rs/LeerdamE.html.
    • (1990) Computertoepassingen in de Neerlandistiek , pp. 7-22
    • Scha, R.1
  • 28
    • 0003312793 scopus 로고
    • Evidence against the context-freeness of natural language
    • Stuart M. Shieber. 1985. Evidence against the context-freeness of natural language. Linguistics and Philosophy, 8:333-343.
    • (1985) Linguistics and Philosophy , vol.8 , pp. 333-343
    • Shieber, S.M.1
  • 29
    • 26444436280 scopus 로고    scopus 로고
    • An annotation scheme for free word order languages
    • Wojciech Skut, Brigitte Krenn, Thorten Brants, and Hans Uszkoreit. 1997. An annotation scheme for free word order languages. In Proceedings of ANLP, pages 88-95.
    • (1997) Proceedings of ANLP , pp. 88-95
    • Skut, W.1    Krenn, B.2    Brants, T.3    Uszkoreit, H.4
  • 30
    • 84874623044 scopus 로고    scopus 로고
    • Discontinuous dataoriented parsing: A mildly context-sensitive allfragments grammar
    • Andreas van Cranenburgh, Remko Scha, and Federico Sangati. 2011. Discontinuous dataoriented parsing: A mildly context-sensitive allfragments grammar. In Proceedings of SPMRL, pages 34-44.
    • (2011) Proceedings of SPMRL , pp. 34-44
    • Cranenburgh, A.V.1    Scha, R.2    Sangati, F.3
  • 31
    • 0001530190 scopus 로고
    • The equivalence of four extensions of context-free grammars
    • K. Vijay-Shanker and David J. Weir. 1994. The equivalence of four extensions of context-free grammars. Theory of Computing Systems, 27(6):511-546.
    • (1994) Theory of Computing Systems , vol.27 , Issue.6 , pp. 511-546
    • Vijay-Shanker, K.1    Weir, D.J.2
  • 32
    • 85027125157 scopus 로고
    • Characterizing structural descriptions produced by various grammatical formalisms
    • K. Vijay-Shanker, David J. Weir, and Aravind K. Joshi. 1987. Characterizing structural descriptions produced by various grammatical formalisms. In Proc. of ACL, pages 104-111.
    • (1987) Proc. of ACL , pp. 104-111
    • Vijay-Shanker, K.1    Weir, D.J.2    Joshi, A.K.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.