An Optimal-Time Binarization Algorithm for Linear Context-Free Rewriting Systems with Fan-Out Two

ACL-IJCNLP 2009 - Joint Conf. of the 47th Annual Meeting of the Association for Computational Linguistics and 4th Int. Joint Conf. on Natural Language Processing of the AFNLP, Proceedings of the Conf.

Volumn , Issue , 2009, Pages 985-993

  Gómez Rodríguez, Carlos ^a   Satta, Giorgio ^b  

^a UNIVERSITY OF A CORUÑA   (Spain)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BINARIZATION ALGORITHM; CONTEXT-FREE; FAN OUT; GRAMMAR FORMALISMS; OPTIMAL TIME; PARSING ALGORITHM; REWRITING SYSTEMS; RUNTIMES;

NATURAL LANGUAGE PROCESSING SYSTEMS;

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

References (14)

1. Pierre Boullier. 2004. Range concatenation grammars. In H. Bunt, J. Carroll, and G. Satta, editors, New Developments in Parsing Technology, volume 23 of Text, Speech and Language Technology, pages 269–289. Kluwer Academic Publishers.
2. Håkan Burden and Peter Ljunglöf. 2005. Parsing linear context-free rewriting systems. In IWPT05, 9th International Workshop on Parsing Technologies.
3. rd ACL, pages 263–270.
4. 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 Proc. of the North American Chapter of the Association for Computational Linguistics - Human Language Technologies Conference (NAACL’09:HLT), Boulder, Colorado. To appear.
5. Aravind K. Joshi and Leon S. Levy. 1977. Constraints on local descriptions: Local transformations. SIAM J. Comput., 6(2):272–284.
6. Aravind K. Joshi, K. Vijay-Shanker, and David Weir. 1991. The convergence of mildly context-sensitive grammatical formalisms. In P. Sells, S. Shieber, and T. Wasow, editors, Foundational Issues in Natural Language Processing. MIT Press, Cambridge MA.
7. th Conference of the European Chapter of the Association for Computational Linguistics (EACL-09), pages 478–486, Athens, Greece.
8. I. Dan Melamed. 2003. Multitext grammars and synchronous parsers. In Proceedings of HLT-NAACL 2003.
9. Rebecca Nesson and Stuart M. Shieber. 2006. Simpler TAG semantics through synchronization. In Proceedings of the 11th Conference on Formal Grammar, Malaga, Spain, 29–30 July.
10. Owen Rambow and Giorgio Satta. 1999. Independent parallelism in finite copying parallel rewriting systems. Theoretical Computer Science, 223:87–120.
11. Giorgio Satta. 1998. Trading independent for synchronized parallelism in finite copying parallel rewriting systems. Journal of Computer and System Sciences, 56(1):27–45.
12. Hiroyuki Seki, Takashi Matsumura, Mamoru Fujii, and Tadao Kasami. 1991. On multiple context-free grammars. Theoretical Computer Science, 88:191–229.
13. th Meeting of the Association for Computational Linguistics (ACL’87).
14. Hao Zhang, Daniel Gildea, and David Chiang. 2008. Extracting synchronous grammar rules from word-level alignments in linear time. In 22nd International Conference on Computational Linguistics (Coling), pages 1081–1088, Manchester, England, UK.