Parsing and generation as Datalog queries

ACL 2007 - Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics

Volumn , Issue , 2007, Pages 176-183

  Kanazawa, Makoto ^a  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT-FREE; DATALOG; DATALOG PROGRAMS; DECISION PROBLEMS; GRAMMAR FORMALISMS; INPUT STRING; LOGICAL FORMS; MONTAGUE SEMANTICS; POLYNOMIAL-TIME ALGORITHMS; QUERY EVALUATION; REALIZABILITY; REDUCTION YIELD; SEARCH PROBLEM;

ALGORITHMS; SEMANTICS;

COMPUTATIONAL LINGUISTICS;

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

References (27)

1. Aoto, Takahito. 1999. Uniqueness of normal proofs in implicational intuitionistic logic. Journal of Logic, Language and Information 8, 217-242.
2. Aoto, Takahito and Hiroakira Ono. 1994. Uniqueness of normal proofs in {→, λ}-fragment of NJ. Research Report IS-RR-94-0024F. School of Information Science, Japan Advanced Institute of Science and Technology.
3. Beeri, Catriel and Raghu Ramakrishnan. 1991. On the power of magic. Journal of Logic Programming 10, 255-299.
4. Engelfriet, J. and E. M. Schmidt. 1977. IO and OI, part I. The Journal of Computer and System Sciences 15, 328-353.
5. Engelfriet, Joost. 1986. The complexity of languages generated by attribute grammars. SIAM Journal on Computing 15, 70-86.
6. Fisher, Michael J. 1968. Grammars with Macro-Like Productions. Ph.D. dissertation. Harvard University.
7. Gottlob, Georg, Nicola Lenoe, Francesco Scarcello. 2002. Computing LOGCFL certificates. Theoretical Computer Science 270, 761-777.
8. de Groote, Philippe. 2001. Towards abstract categorial grammars. In Association for Computational Linguistics, 39th Annual Meeting and 10th Conference of the European Chapter, Proceedings of the Conference, pages 148-155.
9. de Groote, Philippe. 2002. Tree-adjoining grammars as abstract categorial grammars. In Proceedings of the Sixth International Workshop on Tree Adjoining Grammar and Related Frameworks (TAG+6), pages 145-150. Universitá di Venezia.
10. de Groote, Philippe and Sylvain Pogodalla. 2004. On the expressive power of abstract categorial grammars: Representing context-free formalisms. Journal of Logic, Language and Information 13, 421-438.
11. Hindley, J. Roger. 1997. Basic Simple Type Theory. Cambridge: Cambridge University Press.
12. Aravind K. Joshi and Yves Schabes. 1997. Treeadjoining grammars. In Grzegoz Rozenberg and Arto Salomaa, editors, Handbook of Formal Languages, Vol. 3, pages 69-123. Berlin: Springer.
13. Kanazawa, Makoto and Ryo Yoshinaka. 2005. Lexicalization of second-order ACGs. NII Technical Report. NII-2005-012E. National Institute of Informatics, Tokyo.
14. Kanellakis, Paris C. 1988. Logic programming and parallel complexity. In Jack Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 547-585. Los Altos, CA: Morgan Kaufmann.
15. Mints, Grigori. 2000. A Short Introduction to Intuitionistic Logic. New York: Kluwer Academic/Plenum Publishers.
16. Moore, Robert C. 2002. A complete, efficient sentencerealization algorithm for unification grammar. In Proceedings, International Natural Language Generation Conference, Harriman, New York, pages 41-48.
17. Salvati, Sylvain. 2005. Problèmes de filtrage et problèmes d'analyse pour les grammaires catégorielles abstraites. Doctoral dissertation, l'Institut National Polytechnique de Lorraine.
18. Salvati, Sylvain. 2007. Encoding second order string ACG with deterministic tree walking transducers. In Shuly Wintner, editor, Proceedings of FG 2006: The 11th conference on Formal Grammar, pages 143-156. FG Online Proceedings. Stanford, CA: CSLI Publications.
19. Seki, Hiroyuki, Takashi Matsumura, Mamoru Fujii, and Tadao Kasami. 1991. On multiple context-free grammars. Theoretical Computer Science 88, 191-229.
20. Shieber, Stuart M., Yves Schabes, and Fernando C. N. Pereira. 1995. Principles and implementations of deductive parsing. Journal of Logic Programming 24, 3-36.
21. Sikkel, Klaas. 1997. Parsing Schemata. Berlin: Springer.
22. Sørensen, Morten Heine and Paweł Urzyczyn. 2006. Lectures on the Curry-Howard Isomorphism. Amsterdam: Elsevier.
23. Ullman, Jeffrey D. 1988. Principles of Database and Knowledge-Base Systems. Volume I. Rockville, MD.: Computer Science Press.
24. Ullman, Jeffrey D. 1989a. Bottom-up beats top-down for Datalog. In Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Philadelphia, pages 140-149.
25. Ullman, Jeffrey D. 1989b. Principles of Database and Knowledge-Base Systems. Volume II: The New Technologies. Rockville, MD.: Computer Science Press.
26. Ullman, Jeffrey D. and Allen Van Gelder. 1988. Parallel complexity of logical query programs. Algorithmica 3, 5-42.
27. David J. Weir. 1988. Characterizing Mildly Context-Sensitive Grammar Formalisms. Ph.D. dissertation. University of Pennsylvania.