Parsing graphs with hyperedge replacement grammars

ACL 2013 - 51st Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference

Volumn 1, Issue , 2013, Pages 924-932

  Chiang, David ^a   Hermann, Karl Moritz ^b   Andreas, Jacob ^c,e   Jones, Bevan ^d   Bauer, Daniel ^e   Knight, Kevin ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^d UNIVERSITY OF EDINBURGH   (United Kingdom)

^e Department of Earth and Environmental Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

BINARIZATIONS; BOUNDED DEGREE; HYPEREDGE REPLACEMENT; NATURAL LANGUAGE UNDERSTANDING; POLYNOMIAL-TIME; RECOGNITION ALGORITHM; SOFTWARE TOOLKITS;

ALGORITHMS;

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

References (14)

1. Stefan Arnborg, Derek G. Corneil, and Andrzej Proskurowski. 1987. Complexity of finding embeddings in a k-tree. SIAM Journal on Algebraic and Discrete Methods, 8 (2).
2. Hans L. Bodlaender. 1997. Treewidth: Algorithmic techniques and results. In Proc. 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS'97), pages 29-36, Berlin. Springer-Verlag.
3. Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michał Pilipczuk, Johan M. M. van Rooij, and Jakub Onufry Wojtaszczyk. 2011. Solving connectivity problems parameterized by treewidth in single exponential time. Computing Research Repository, abs/1103.0534.
4. Frank Drewes, Hans-Jörg Kreowski, and Annegret Habel. 1997. Hyperedge replacement graph grammars. In Grzegorz Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation, pages 95-162. World Scientific.
5. Daniel Gildea. 2011. Grammar factorization by tree decomposition. Computational Linguistics, 37(1):231-248.
6. Vibhav Gogate and Rina Dechter. 2004. A complete anytime algorithm for treewidth. In Proceedings of the Conference on Uncertainty in Artificial Intelligence.
7. Bevan Jones, Jacob Andreas, Daniel Bauer, Karl Moritz Hermann, and Kevin Knight. 2012. Semantics-based machine translation with hyperedge replacement grammars. In Proc. COLING.
8. Aravind K. Joshi and Yves Schabes. 1997. Treeadjoining grammars. In Grzegorz Rozenberg and Arto Salomaa, editors, Handbook of Formal Languages and Automata, volume 3, pages 69-124. Springer.
9. Clemens Lautemann. 1990. The complexity of graph languages generated by hyperedge replacement. Acta Informatica, 27:399-421.
10. Steffen Mazanek and Mark Minas. 2008. Parsing of hyperedge replacement grammars with graph parser combinators. In Proc. 7th International Workshop on Graph Transformation and Visual Modeling Techniques.
11. Richard Moot. 2008. Lambek grammars, tree adjoining grammars and hyperedge replacement grammars. In Proc. TAG+9, pages 65-72.
12. Grzegorz Rozenberg and Emo Welzl. 1986. Boundary NLC graph grammars-basic definitions, normal forms, and complexity. Information and Control, 69:136-167.
13. Stuart M. Shieber, Yves Schabes, and Fernando C. N. Pereira. 1995. Principles and implementation of deductive parsing. Journal of Logic Programming, 24:3-36.
14. Lappoon Tang and Raymond Mooney. 2001. Using multiple clause constructors in inductive logic programming for semantic parsing. In Proc. European Conference on Machine Learning.