Abstract
First introduced by [12], pomset linear logic can deal with linguistic aspects by inducing a partial order on words. [9] uses this property: it defines modules (or partial proof-nets) which consist in entries for words, describing both the category of the word and its behavior when interacting with other words. Then the natural question of comparing the generative power of such grammars with Tree Adjoining Grammars [7], as [6] pointed some links out, arises.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abeillé, A. Les nouvelles syntaxes. Armand Colin Éditeur, Paris, Armand Colin Éditeur, 103, boulevard St-Michel-75240 Paris, 1993.
Abrusci, V. M. Non-commutative proof nets. In Girard, J.-Y., Y. Lafont, and L. Regnier, editors, Advances in Linear Logic, pages 271–296. Cambridge University Press, 1995. Proceedings of the Workshop on Linear Logic, Ithaca, New York, June 1993.
Abrusci, V. M., C. Fouqueré, and J. Vauzeilles. Tree adjoining grammars in non-commutative linear logic. In Retoré, C., editor, LACL’96, volume 1328 of LNCS/LNAI, pages 96–117. Springer-Verlag Inc., New-York, USA, September23-25 1996.
Girard, J.-Y. Linear logic. In Theoretical Computer Science, 50:1–102, 1987.
de Groote, P. and C. Retoré. On the semantic readings of proof-nets. In Geert-Jan Kruijff, G. M. and D. Oehrle, editors, Formal Grammar, pages 57–70. FoLLI, Prague, August 1996.
Joshi, A. K. and S. Kulick. Partial proof trees, resource sensitive logics and syntactic constraints. In Retoré, C., editor, LACL’96, volume 1328 of LNCS/LNAI, pages 21–42. Springer-Verlag Inc., New-York, USA, September23-25 1996.
Joshi, A. K., L. S. Levy, and M. Takahashi. Tree adjunct grammars. In Journal of Computer and System Sciences, 10(1):136–163, 1975.
Lamarche, F. Proof nets for intuitionistic linear logic: Essantial nets. Technical report, Imperial College, 1994.
Lecomte, A. and C. Retoré. Pomset logic as an alternative categorial grammar. In Formal Grammar. Barcelona, 1995.
Lecomte, A. and C. Retoré. Words as modules: a lexicalised grammar in the framework of linear logic proof nets. In International Conference on Mathematical Linguistics. John Benjamins, Tarragona, Spain, 1996.
Lecomte, A. and C. Retoré. Logique de ressources et réseaux syntaxiques. In Genthial, D., editor, TALN’97, pages 70–83. Pôle langage naturel, Grenoble, 12-13June 1997.
Retoré, C. Réseaux et séquents ordonnés. Ph.D. thesis, University of Paris VII, 1993.
Retoré, C. Perfect matchings and series-parallel graphs: multiplicatives proof nets as r&b-graphs. In Girard, J.-Y., M. Okada, and A. Scedrov, editors, Linear Logic 96 Tokyo Meeting, volume 3 of Electronic Notes in Theoretical Computer Science. april 1996.
Retoré, C. Pomset logic: a non-commutative extension of classical linear logic. In TLCA’97, volume 1210 of LNCS, pages 300–318. 1997.
Schabes, Y., A. Abeille, and A. K. Joshi. Parsing strategies with’ lexicalized’ grammars. In 12th International Conference on Computational Linguistics (COL-ING’88), volume 2, pages 579–583. 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pogodalla, S. (2001). Lexicalized Proof-Nets and TAGs. In: Moortgat, M. (eds) Logical Aspects of Computational Linguistics. LACL 1998. Lecture Notes in Computer Science(), vol 2014. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45738-0_14
Download citation
DOI: https://doi.org/10.1007/3-540-45738-0_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42251-8
Online ISBN: 978-3-540-45738-1
eBook Packages: Springer Book Archive