Abstract
We describe a categorial system (PPTS) based on partial proof trees(PPTs) as the building blocks of the system. The PPTs are obtained byunfolding the arguments of the type that would be associated with a lexicalitem in a simple categorial grammar. The PPTs are the basic types in thesystem and a derivation proceeds by combining PPTs together. We describe theconstruction of the finite set of basic PPTs and the operations forcombining them. PPTS can be viewed as a categorial system incorporating someof the key insights of lexicalized tree adjoining grammar, namely the notionof an extended domain of locality and the consequent factoring of recursionfrom the domain of dependencies. PPTS therefore inherits the linguistic andcomputational properties of that system, and so can be viewed as a ’middleground‘ between a categorial grammar and a phrase structure grammar. We alsodiscuss the relationship between PPTS, natural deduction, and linear logicproof-nets, and argue that natural deduction rather than a proof-net systemis more appropriate for the construction of the PPTs. We also discuss howthe use of PPTs allows us to ’localize‘ the management of resources, therebyfreeing us from this management as the PPTs are combined.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abrusci, M.: 1991, ‘Phase Semantics and Sequent Calculus for Pure Noncommutative Classical Linear Propositional Logic’, Journal of Symbolic Logic 56(4), 1403–1451.
Abrusci, M., Ch. Fouqueré, and J. Vauzeilles: 1996, ‘Tree Adjoining Grammar and Non-Commutative Linear Logic’, in Proceedings of Logical Aspects of Computational Linguistics.
Bar-Hillel, Y., C. Gaifman, and E. Shamir: 1960, ‘On Categorial and Phrase Structure Grammars’, Bulletin of the Research Council of Israel 9F, 1–16.
Barry, G., M. Hepple, N. Leslie, and G. Morrill: 1991, ‘Proof Figures and Structural Operators for Categorial Grammar’, in Proceedings of the Fifth Conference of the European Chapter of the Association for Computational Linguistics.
Garrigue, J. and H. Aït-Kaci: 1994, ‘The Typed Polymorphic Label-Selective λ-Calculus’, POPL.
Girard, J.-Y.: 1995, ‘Linear Logic: Its Syntax and Semantics’, in Girard, Lafont, and Regnier (eds.), Advances in Linear Logic, Cambridge University Press, Cambridge, England, pp. 1–42.
Henderson, J.: 1992, A Structural Interpretation of Combinatory Categorial Grammar, University of Pennsylvania Technical Report, MS-CIS-92-49.
Johnson, M.: 1996, Natural Deduction and Proof Nets Intuitionistic Linear Logic, Manuscript, Brown University.
Joshi, A. K.: 1992, ‘TAGs in Categorial Clothing’, presented at the Tree Adjoining Grammar Workshop (TAG+), Institute for Research in Cognitive Science, University of Pennsylvania, Philadelphia, June 1992. A revised version, ‘Unfolded Types’, was presented at the Logic and Language Workshop, LSA, Ohio State University, August 1993.
Joshi, A. K. and S. Kulick: 1997, ‘Implementational Aspects of a Categorial Grammar Based on Partial Proof Trees’, in Ginzburg et al. (eds.), The Tbilisi Symposium on Logic, Language and Computation, CSLI Publications.
Joshi, A. K. and Y. Schabes: 1997, ‘Tree Adjoining Grammars’, To appear in A. Saolmaa and G. Rosenberg (eds.), Handbook of Formal Languages and Automata, Vol. 3, Springer-Verlag, Heidelberg.
Joshi, A. K., K. Vijay-Shanker, and D. Weir: 1991, ‘The Convergence of Mildly Context-Sensitive Grammar Formalisms’, in P. Sells, S. Shieber, and T. Wasow (eds.), Foundational Issues in Natural Language Processing, Cambridge, MA: MIT Press.
Joshi, A. K., K. Vijay-Shanker, and D. Weir: 1988, ‘Characterizing Structural Descriptions Produced by Various Grammatical Formalisms’, in 23rd Annual Meeting of the Association for Computational Linguistics.
Kasper, R., B. Kiefer, K. Netter, and K. Vigay-Shanker: 1995, ‘Compilation of HPSG to TAG’, in 30th Annual Meeting of the Association for Computational Linguistics.
Kroch, A. S. and A. K. Joshi: 1985, ‘The Linguistic Relevance of Tree Adjoining Grammars’, Technical Report MS-CIS-85-16, Department of Computer and Information Science, University of Pennsylvania.
Lecomte and Retoré: 1995, ‘Words as Modules and Modules as Partial Proof-Nets’, in J. Benjamins (ed.), Proceedings of ICML 96, Tarragona.
Milward, D.: 1994, ‘Non-Constituent Coordination: Theory and Practice’, in Proceedings of the 15th International Conference on Computational Linguistics, Coling 94, Kyoto, Japan.
Moortgat, M.: 1988, Categorial Investigations: Logical and Linguistic Aspects of the Lambek Calculus, Foris, Dordrecht.
Morrill, G.: 1994, Type-Logical Grammar, Kluwer, Dordrecht.
Morrill, G.: 1995, ‘Clausal Proofs and Discontinuity’, in Bulletin of the IGPL, Vol. 3,Nos. 2, 3, pp. 403–427.
Nadathur, G. and D. Miller: 1988, ‘An Overview of λProlog’, in R. A. Kowalski and K. A. Bowen (eds.), Logic Programming: Proceedings of the Fifth International Conference and Symposium, Vol. 1, Seattle, WA, MIT Press, pp. 810–827.
Pollard, C.: 1988, ‘Categorial Grammar and Phrase Structure Grammar: An Excursion on the Syntax-Semantics Frontier’, in Ochrle, Bach, and Wheeler (eds.), Categorial Grammar and Natural Language Structures, Studies in Linguistics and Philosophy, Vol. 32, D. Reidel, Dordrecht, pp. 391–415.
Roorda, D.: 1991, Resource Logics: Proof-Theoretical Investigations, Ph.D. dissertation, Universiteit van Amsterdam.
Sarkar, A. and A. Joshi: 1991, ‘Coordination in Tree Adjoining Grammars: Formalization and Implementation’, in Proceedings of the International Conference on Computational Linguistics, COLING96, Copenhagen.
Steedman, M.: 1987, ‘Combinatory Grammars and Parasitic Gaps’, Natural Language and Linguistic Theory 5, 403–439.
Steedman, M.: 1997, Surface Structure and Interpretation, MIT Press, (in press).
Szabolcsi, A.: 1989, ‘Bound Variables in Syntax: Are There Any?’, in R. Bartsch, J. van Benthem, and P. van Emde Boas (eds.), Semantics and Contextual Expression, Foris, Dordrecht, pp. 295–318.
Vijay-Shanker, K.: 1992, ‘Using Descriptions of Trees in a Tree Adjoining Grammar’, Computational Linguistics 18(4), 481–517.
Xtag-Group: 1996, A Lexicalized Tree Adjoining Grammar for English, Technical Report IRCS 95-03, University of Pennsylvania.
Yetter, D. N.: 1990, ‘Quantales and (Noncommutative) Linear Logic’, Journal of Symbolic Logic 55, 41–64.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Joshi, A.K., Kulick, S. Partial Proof Trees as Building Blocks for a Categorial Grammar. Linguistics and Philosophy 20, 637–667 (1997). https://doi.org/10.1023/A:1005311532280
Issue Date:
DOI: https://doi.org/10.1023/A:1005311532280