Discontinuous parsing with an efficient and accurate DOP model

Proceedings of the 13th International Conference on Parsing Technologies, IWPT 2013

Volumn , Issue , 2013, Pages 7-16

  van Cranenburgh, Andreas ^a   Bod, Rens ^b  

^a Huygens Institute KNAW   (Netherlands)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT-FREE; DATA-ORIENTED PARSING; ERROR REDUCTION; RELATIVE ERRORS; REWRITING SYSTEMS; TREE SUBSTITUTION GRAMMARS; TREEBANKS;

FORESTRY;

EID: 84921933443     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (41)

1. Mohit Bansal and Dan Klein. 2010. Simple, accurate parsing with an all-fragments grammar. In Proceedings of ACL, pages 1098-1107.
2. Shane Bergsma, Matt Post, and David Yarowsky. 2012. Stylometric analysis of scientific articles. In Proceedings of NAACL, pages 327-337. http://aclweb.org/anthology/N12-1033.
3. Ezra Black, John Lafferty, and Salim Roukos. 1992. Development and evaluation of a broad-coverage probabilistic grammar of English-language computer manuals. In Proceedings of ACL, pages 185-192. http://aclweb.org/anthology/P92-1024.
4. Rens Bod. 1995. The problem of computing the most probable tree in data-oriented parsing and stochastic tree grammars. In Proceedings of EACL, pages 104-111. http://aclweb.org/anthology/E95-1015.
5. Rens Bod. 2001. What is the minimal set of fragments that achieves maximal parse accuracy? In Proceedings of ACL, pages 69-76.
6. Rens Bod, Remko Scha, and Khalil Sima'an, editors. 2003. Data-Oriented Parsing. The University of Chicago Press.
7. Pierre Boullier. 1998. Proposal for a natural language processing syntactic backbone. Technical Report RR-3342, inria-Rocquencourt, Le Chesnay, France. http://www.inria.fr/RRRT/RR-3342.html.
8. Sabine Brants, Stefanie Dipper, Silvia Hansen, Wolfgang Lezius, and George Smith. 2002. The Tiger treebank. In Proceedings of the workshop on treebanks and linguistic theories, pages 24-41.
9. Eugene Charniak. 1996. Tree-bank grammars. In Proceedings of the National Conference on Artificial Intelligence, pages 1031-1036.
10. Eugene Charniak, Mark Johnson, M. Elsner, J. Austerweil, D. Ellis, I. Haxton, C. Hill, R. Shrivaths, J. Moore, M. Pozar, et al. 2006. Multilevel coarse-to-fine PCFG parsing. In Proceedings of NAACL-HLT, pages 168-175.
11. Trevor Cohn, Phil Blunsom, and Sharon Goldwater. 2010. Inducing tree-substitution grammars. The Journal of Machine Learning Research, 11(Nov):3053-3096.
12. Amit Dubey and Frank Keller. 2003. Parsing german with sister-head dependencies. In Proceedings of ACL, pages 96-103.
13. Kilian Evang and Laura Kallmeyer. 2011. PLCFRS parsing of English discontinuous constituents. In Proceedings of IWPT, pages 104-116. http://aclweb.org/anthology/W11-2913.
14. Ryan Gabbard, Seth Kulick, and Mitchell Marcus. 2006. Fully parsing the Penn treebank. In Proceedings of NAACL-HLT, pages 184-191.
15. Daniel Gildea. 2010. Optimal parsing strategies for linear context-free rewriting systems. In Proceedings of NAACL HLT 2010., pages 769-776.
16. Joshua Goodman. 2003. Efficient parsing of DOP with PCFG-reductions. In Bod et al. (2003).
17. Spence Green, Marie-Catherine de Marneffe, John Bauer, and Christopher D. Manning. 2011. Multiword expression identification with tree substitution grammars: A parsing tour de force with French. In Proceedings of EMNLP, pages 725-735.
18. Johan Hall and Joakim Nivre. 2008. Parsing discontinuous phrase structure with grammatical functions. In Bengt Nordstrm and Aarne Ranta, editors, Advances in Natural Language Processing, volume 5221 of Lecture Notes in Computer Science, pages 169-180. Springer Berlin/Heidelberg. http://dx.doi.org/10.1007/978-3-540-85287-2_17.
19. Liang Huang and David Chiang. 2005. Better k-best parsing. In Proceedings of IWPT 2005, pages 53-64.
20. Mark Johnson. 2002. A simple pattern-matching algorithm for recovering empty nodes and their antecedents. In Proceedings of ACL, pages 136-143.
21. Laura Kallmeyer and Wolfgang Maier. 2010. Data-driven parsing with probabilistic linear context-free rewriting systems. In Proceedings of the 23rd International Conference on Computational Linguistics, pages 537-545.
22. Laura Kallmeyer and Wolfgang Maier. 2013. Data-driven parsing using probabilistic linear context-free rewriting systems. Computational Linguistics, 39(1):87-119.
23. Dan Klein and Christopher D. Manning. 2003. Accurate unlexicalized parsing. In Proceedings of ACL, volume 1, pages 423-430.
24. Wolfgang Maier. 2010. Direct parsing of discontinuous constituents in German. In Proceedings of the SPMRL workshop at NAACL HLT 2010, pages 58-66.
25. Wolfgang Maier and Anders Søgaard. 2008. Treebanks and mild context-sensitivity. In Proceedings of Formal Grammar 2008, pages 61-76.
26. Matt Post. 2011. Judging grammaticality with tree substitution grammar derivations. In Proceedings of the ACL-HLT 2011, pages 217-222.
27. Matt Post and Daniel Gildea. 2009. Bayesian learning of a tree substitution grammar. In Proceedings of the ACL-IJCNLP 2009 Conference Short Papers, pages 45-48.
28. Federico Sangati and Willem Zuidema. 2011. Accurate parsing with compact tree-substitution grammars: Double-DOP. In Proceedings of EMNLP, pages 84-95. http://aclweb.org/anthology/D11-1008.
29. Federico Sangati, Willem Zuidema, and Rens Bod. 2010. Efficiently extract recurring tree fragments from large treebanks. In Proceedings of LREC, pages 219-226. http://dare.uva.nl/record/371504.
30. 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.
31. Helmut Schmid. 2006. Trace prediction and recovery with unlexicalized PCFGs and slash features. In Proceedings of COLING-ACL, pages 177-184.
32. Hiroyuki Shindo, Yusuke Miyao, Akinori Fujino, and Masaaki Nagata. 2012. Bayesian symbol-refined tree substitution grammars for syntactic parsing. In Proceedings of ACL, pages 440-448. http://aclweb.org/anthology/P12-1046.
33. 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.
34. Benjamin Swanson and Eugene Charniak. 2012. Native language detection with tree substitution grammars. In Proceedings of ACL, pages 193-197. http://aclweb.org/anthology/P12-2038.
35. Andreas van Cranenburgh. 2012a. Efficient parsing with linear context-free rewriting systems. In Proceedings of EACL, pages 460-470. http://aclweb.org/anthology/E12-1047.
36. Andreas van Cranenburgh. 2012b. Extracting tree fragments in linear average time. Technical Report PP-2012-18, FNWI/FGw: Institute for Logic, Language and Computation (ILLC). http://dare.uva.nl/en/record/421534.
37. Andreas van Cranenburgh. 2012c. Literary authorship attribution with phrase-structure fragments. In Proceedings of the NAACL-HLT 2012 Workshop on Computational Linguistics for Literature, pages 59-63. http://aclweb.org/anthology/W12-2508.
38. Andreas van Cranenburgh, Remko Scha, and Federico Sangati. 2011. Discontinuous data-oriented parsing: A mildly context-sensitive all-fragments grammar. In Proceedings of SPMRL, pages 34-44. http://aclweb.org/anthology/W11-3805.
39. Leonoor van der Beek, Gosse Bouma, Robert Malouf, and Gertjan van Noord. 2002. The Alpino dependency treebank. Language and Computers, 45(1):8-22.
40. Gertjan Van Noord. 2009. Huge parsed corpora in Lassy. In Proceedings of TLT7. LOT, Groningen, The Netherlands.
41. K. Vijay-Shanker, David J. Weir, and Aravind K. Joshi. 1987. Characterizing structural descriptions produced by various grammatical formalisms. In Proceedings of ACL, pages 104-111. http://www.aclweb.org/anthology/P87-1015.