Skip to main content

Wide-Coverage lexicalized grammars

  • Natural Language 1
  • Conference paper
  • First Online:
AI*IA 97: Advances in Artificial Intelligence (AI*IA 1997)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1321))

Included in the following conference series:

  • 159 Accesses

Abstract

This paper proposes a hierarchical organization of the linguistic knowledge, that views grammar as an abstraction of item-dependent information (in particular, an abstraction of subcategorization frames into a hierarchy of classes). The formalism has been successfully applied to a classification of 105 Italian verbal frames, developed by analysing a corpus of about 500,000 words.

The proposed framework (expressed in a dependency approach) is of linguistic and computational interest. From a linguistic point of view, it is a clear, significant and non-redundant representation. From a computational point of view, structuring the grammar into a hierarchy allows to define a predictive component for parsing, exploiting the information at many levels of the hierarchy: this allows to reduce the ambiguity, a very big problem in large scale NLP systems.

We are indebted to Paola Merlo and Leonardo Lesmo for their precious support.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Ravera Aira, R. Maurizzi, and F. Piazzi. Grammatica italiana. Paccagnella Editore, 1980.

    Google Scholar 

  2. C. Barbero. Subcategorization in Dependency Grammar and Parsing. Doctoral Dissertation, Centro di Scienza Cognitiva, University di Torino, forthcoming, 1997.

    Google Scholar 

  3. R. Borsley. Subjects and complements in HPSG. Report CSLI, Stanford, CA: Center for the Study of Language and Information, pages 87–107, 1987.

    Google Scholar 

  4. M.H. Candito. A principle-based hierarchical representation of LTAGs. In Proceedings of COLING'96, 1996.

    Google Scholar 

  5. G. Gazdar, E. Klein, G.K. Pullum, and I.A. Sag. Generalized Phrase Structure Grammars. Blackwell Publishing, Oxford, 1985.

    Google Scholar 

  6. XTAG Group. A Lexicalized Tree-Adjoining Grammar of English. Techical Report, IRCS, University of Pennsylvania, 1995.

    Google Scholar 

  7. R. Hudson. English Word Grammar. Basil Blackwell, 1990.

    Google Scholar 

  8. A. Joshi and Y. Schabes.Tree-Adjoining Grammars.In A. Salomaa and G. Rozenberg, editors, Handbook of Formal Languages and Automata. Springer-Verlag, Berlin, 1996.

    Google Scholar 

  9. R. Kaplan and J. Bresnan. Lexical-Functional Grammar: a Formal System for Grammatical Representation. In J. Bresnan, editor, The Mental Representation of Grammatical Relations, pages 173–281. MIT Press, Cambridge, Mass., 1983.

    Google Scholar 

  10. V. Lombardo and L. Lesmo. An Earley-type recognizer for Dependency Grammar. In Proceedings of COLING'96, 1996.

    Google Scholar 

  11. F. Palazzi and G. Folena. Dizionario della lingua italiana. Loescher, 1992.

    Google Scholar 

  12. C. Pollard and I. Sag. Head-Driven Phrase Structure Grammar. The University of Chicago Press, Chicago, IL, 1994.

    Google Scholar 

  13. L. Renzi. Grande grammatica italiana di consultazione. Il Mulino, 1988.

    Google Scholar 

  14. Y. Schabes. Mathematical and Computational Aspects of Lexicalized Grammars. PhD thesis, University of Pennsylvania, 1990.

    Google Scholar 

  15. H.L. Somers. Valency and Case in Computational Linguistics. Edinburgh University Press, 1987.

    Google Scholar 

  16. M. Steedman. Combinatory Grammars and parasitic gaps. Natural Language and Linguistic Theory, 5:403–439, 1987.

    Google Scholar 

  17. O. Stock. Parsing with flexibility, dynamic strategies, and idioms in mind. Computational Linguistics, 15:1–18, 1989.

    Google Scholar 

  18. M. Tomita. Efficient Parsing for Natural Language. Kluwer Academic Publishers, 1985.

    Google Scholar 

  19. D.H. Younger. Recognition and parsing of Context-Free languages in time n3. Information and Control, 10/2:189–208, 1967.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Maurizio Lenzerini

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barbero, C., Lombardo, V. (1997). Wide-Coverage lexicalized grammars. In: Lenzerini, M. (eds) AI*IA 97: Advances in Artificial Intelligence. AI*IA 1997. Lecture Notes in Computer Science, vol 1321. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63576-9_96

Download citation

  • DOI: https://doi.org/10.1007/3-540-63576-9_96

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63576-5

  • Online ISBN: 978-3-540-69601-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics