Tree adjoining grammars in a fragment of the Lambenk calculus

Computational Linguistics

Volumn 25, Issue 2, 1999, Pages 208-236

  Abrusci, V Michele ^a   Fouqueré, Christophe ^b   Vauzeilles, Jacqueline ^b  

^a UNIVERSITY OF BARI   (Italy)

^b UNIVERSITÉ PARIS 13   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; CONTEXT SENSITIVE GRAMMARS; DIFFERENTIATION (CALCULUS);

ELEMENTARY TREES; GEOMETRIC REPRESENTATION; LAMBEK CALCULUS; LOGICAL FORMALISM; LOGICAL FORMALIZATION; LOGICAL REPRESENTATIONS; PARSE TREES; TREE ADJOINING GRAMMARS;

FORESTRY;

EID: 0040807396     PISSN: 08912017     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. Abeillé, Anne, K. Bishop, S. Cote, and Yves Schabes. 1990. A lexicalized tree-adjoining grammar for English. Technical Report MS-CIS-90-24, LINC LAB 170, Computer Science Department, University of Pennsylvania, Philadelphia, PA.
2. Abrusci, Michele. 1991. Phase semantics and sequent calculus for pure noncommutative classical linear prepositional logic. The Journal of Symbolic Logic, 56(4):1,403-1,451.
3. Abrusci, Michele. 1995. Noncommutative proof nets. In Jean-Yves Girard, Yves Lafont, and Laurent Regnier, editors, Advances in Linear Logic, volume 222. Cambridge University Press, pages 271-296. Proceedings of the Workshop on Linear Logic, Ithaca, NY, June 1993.
4. Bar-Hillel, Yoshua. 1953. A quasi-arithmetical notation for syntactic description. Language, 29:47-58.
5. Girard, Jean-Yves. 1987. Linear logic. Theoretical Computer Science, 50:1-102.
6. Joshi, Aravind K. and Seth Kulick. 1995. Partial proof trees as building blocks for a categorial grammar. In Glyn Morrill and Richard T. Oehrle, editors, Formal Grammar, Proceedings of the Conference of the European Summer School of Logic, Language and Information, Barcelona, August. Also as Technical Report, Institute for Research in Cognitive Science, University of Pennsylvania, Philadelphia, PA, March 1996.
7. Joshi, Aravind K., Leon S. Levy, and M. Takahashi. 1975. Tree adjunct grammars. Journal of Computer and System Sciences, 10(1):136-163.
8. Kroch, Anthony S. and Aravind K. Joshi. 1985. Linguistic relevance of tree adjoining grammars. Technical Report MS-CIS-85-18, LINC LAB 170, Computer Science Department, University of Pennsylvania, Philadelphia, PA.
9. Lambek, Joachim. 1958. The mathematics of sentence structure. American Math. Monthly, 65:154-169.
10. Roorda, Dirk. 1992. Proof nets for Lambek calculus. Journal of Logic and Computation, 2(2):211-231.
11. Vijay-Shanker, K. 1992. Using descriptions of trees in a tree adjoining grammar. Computational Linguistics, 18(4):481-517.
12. Vijay-Shanker, K. and Aravind K. Joshi. 1985. Some computational properties of tree adjoining grammars. In Proceedings of the 23rd Annual Meeting, pages 82-93. Association for Computational Linguistics.
13. Vijay-Shanker, K. and David J. Weir. 1994a. The equivalence of four extensions of context-free grammars. Mathematical Systems Theory, 27:511-545.
14. Vijay-Shanker, K. and David J. Weir. 1994b. Parsing some constrained grammar formalisms. Computational Linguistics, 19(4):591-636.