Discontinuous Data-Oriented Parsing: A mildly context-sensitive all-fragments grammar

2nd Workshop on Statistical Parsing of Morphologically Rich Languages, SPMRL 2011 - collocate with the International Workshop on Parsing Technologies, IWPT 2011 - Proceedings

Volumn , Issue , 2011, Pages 34-44

  van Cranenburgh, Andreas ^a   Scha, Remko ^a   Sangati, Federico ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; TREES (MATHEMATICS);

CONTEXT-SENSITIVE; DATA-ORIENTED PARSING; DISCONTINUOUS DATA; GRAMMAR FORMALISMS; PARSING TECHNOLOGIES; PERFORMANCE; STATE OF THE ART; TREEBANKS;

FORESTRY;

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

References (36)

1. Mohit Bansal and Dan Klein. 2010. Simple, accurate parsing with an all-fragments grammar. In Proceedings of ACL, pages 1098-1107.
2. François Barthélemy, Pierre Boullier, Philippe Deschamp, and Éric de la Clergerie. 2001. Guided parsing of range concatenation languages. In Proceedings of ACL, pages 42-49.
3. Tilman Becker, Owen Rambow, and Michael Niv. 1992. The derivational generative power of formal systems or scrambling is beyond LCFRS. Technical Report IRCS-92-38, Institute for research in cognitive science. URL ftp://ftp.cis.upenn.edu/pub/ircs/tr/92-38.ps.Z.
4. Stefan Behnel, Robert Bradshaw, Craig Citro, Lisandro Dalcin, Dag Sverre Seljebotn, and Kurt Smith. 2011. Cython: The best of both worlds. Computing in Science and Engineering, 13:31-39.
5. Steven Bird, Ewan Klein, and Edward Loper. 2009. Natural Language Processing with Python. O'Reilly Media.
6. Rens Bod. 1992. A computational model of language performance: Data-oriented parsing. In Proceedings COLING'92 (Nantes, France), pages 855-859.
7. Rens Bod. 2003. An efficient implementation of a new DOP model. In Proceedings of EACL, volume 1, pages 19-26. URL http://www.ldc.upenn.edu/acl/E/E03/E03-1005.pdf.
8. Pierre Boullier. 1998. Proposal for a natural language processing syntactic backbone. Technical Report RR-3342, IN RIARocquencourt, Le Chesnay, France. URL http://www.inria.fr/RRRT/RR-3342.html.
9. Adriane Boyd. 2007. Discontinuity revisited: An improved conversion to context-free representations. In Proceedings of the Linguistic Annotation Workshop, pages 41-44.
10. 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.
11. Eugene Charniak and Mark Johnson. 2005. Coarse-to-fine n-best parsing and maxent discriminative reranking. In Proceedings of ACL, pages 173-180.
12. Noam Chomsky. 1957. Syntactic Structures. Mouton, The Hague.
13. 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.
14. Joshua Goodman. 1996. Efficient algorithms for parsing the DOP model. In Proceedings of EMNLP, pages 143-152.
15. 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.
16. Liang Huang and David Chiang. 2005. Better k-best parsing. In Proceedings of IWPT 2009, pages 53-64.
17. Mark Johnson. 1985. Parsing with discontinuous constituents. In Proceedings of ACL, pages 127-132.
18. 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.
19. Dan Klein and Christopher D. Manning. 2003a. Accurate unlexicalized parsing. In Proceedings of ACL, volume 1, pages 423-430.
20. Dan Klein and Christopher D. Manning. 2003b. Fast exact inference with a factored model for natural language parsing. Advances in neural information processing systems, pages 3-10.
21. Wolfgang Maier. 2010. Direct parsing of discontinuous constituents in German. In Proceedings of the SPMRL workshop at NAACL HLT 2010, pages 58-66.
22. Wolfgang Maier and Laura Kallmeyer. 2010. Discontinuity and non-projectivity: Using mildly contextsensitive formalisms for data-driven parsing. In Proceedings of TAG, volume 10.
23. Wolfgang Maier and Anders Søgaard. 2008. Treebanks and mild context-sensitivity. In Proceedings of Formal Grammar 2008, page 61.
24. Mark-Jan Nederhof. 2003. Weighted deductive parsing and Knuth's algorithm. Computational Linguistics, 29(1):135-143.
25. Adam Pauls and Dan Klein. 2009. K-best A* parsing. In Proceedings of ACL, volume 2, pages 958-966.
26. 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.
27. Ines Rehbein and Josef van Genabith. 2007. Evaluating evaluation measures. In NODALIDA 2007 Conference Proceedings, pages 372-379. URL http://doras.dcu.ie/15237.
28. Federico Sangati and Willem Zuidema. 2011. Accurate parsing with compact tree-substitution grammars: Double-DOP. In Proceedings of EMNLP, pages 84-95. URL http://www.aclweb.org/anthology/D11-1008.
29. Walter J. Savitch, Emmon Bach, W. Marsh, and Gila Safran-Naveh. 1987. The Formal Complexity of Natural Language, volume 33 of Linguistics and Philosophy. D. Reidel.
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. Stuart M. Shieber. 1985. Evidence against the context-freeness of natural language. Linguistics and Philosophy, 8:333-343.
32. Khalil Sima'an. 1996. Computational complexity of probabilistic disambiguation by means of tree-grammars. In Proceedings of the 16th conference on Computational linguistics, volume 2, pages 1175-1180.
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. Ann Taylor, Mitchell Marcus, and Beatrice Santorini. 2003. The penn treebank: an overview. In Anne Abeillé, editor, Treebanks: Building and using parsed corpora, pages 5-22. Springer.
35. Reut Tsarfaty. 2010. Relational-realizational parsing. Ph.D. thesis, University of Amsterdam. URL http://dare.uva.nl/record/335795.
36. 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.