Skip to main content
SpringerLink
Log in

A Savateev-Style Parsing Algorithm for Pregroup Grammars

  • Conference paper
Formal Grammar (FG 2009)

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

Included in the following conference series:

Abstract

We present a new cubic parsing algorithm for ambiguous pregroup grammars. It modifies the recognition algorithm of Savateev [10] for categorial grammars based on \(\textbf{L}^{\backslash}\). We show the correctness of the algorithm and give some examples. We compare our algorithm with the algorithm of Oehrle [8] for pregroup grammars and the algorithm of Savateev [10].

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Béchet, D.: Parsing Pregroup Grammars and Lambek Calculus using Partial Composition. Studia Logica 87(2-3), 199–224 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  2. Buszkowski, W.: Lambek Grammars Based on Pregroups. In: de Groote, P., Morrill, G., Retorè, C. (eds.) LACL 2001. LNCS (LNAI), vol. 2099, p. 95. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Buszkowski, W.: Type Logics and Pregroups. Studia Logica 87(2-3), 145–169 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Buszkowski, W., Moroz, K.: Pregroup grammars and context-free grammars. In: Casadio, C., Lambek, J. (eds.) Computational Algebraic Approaches to Natural Language, Polimetrica, pp. 1–21 (2008)

    Google Scholar 

  5. Lambek, J.: Type Grammars Revisited. In: Lecomte, A., Lamarche, F., Perrier, G. (eds.) LACL 1997. LNCS (LNAI), vol. 1582, pp. 1–27. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  6. Lambek, J.: From Word to Sentence: a computational algebraic approach to grammar, Polimetrica (2008)

    Google Scholar 

  7. Mootrgat, M., Oehrle, R.: Pregroups and type-logical grammar: searching for convergence. In: Casadio, C., Scott, P.J., Seely, R.A.G. (eds.) Language and Grammar, pp. 141–160. CSLI Publications, Stanford (2005)

    Google Scholar 

  8. Oehrle, R.: A parsing algorithm for pregroup grammars. In: Proceedings of Categorial Grammars, Montpellier France, pp. 59–75 (2004)

    Google Scholar 

  9. Preller, A.: Linear Processing with Pregroups. Studia Logica 87(2-3), 171–197 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Savateev, Y.: Unidirectional Lambek Grammars in Polynomial Time, Theory of Computing Systems (to appear)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznań, Poland

    Katarzyna Moroz

Authors
  1. Katarzyna Moroz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. INRIA Nancy - Grand Est, 615 Rue du Jardin Botanique, 54600, Villers-lès-Nancy, France

    Philippe de Groote

  2. Institut für Anglistik und Amerikanistik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10117, Berlin, Germany

    Markus Egg

  3. Institut für Sprache und Information, Heinrich-Heine-Universität Düsseldorf, Universitätsstraße 1, 40225, Düsseldorf, Germany

    Laura Kallmeyer

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moroz, K. (2011). A Savateev-Style Parsing Algorithm for Pregroup Grammars. In: de Groote, P., Egg, M., Kallmeyer, L. (eds) Formal Grammar. FG 2009. Lecture Notes in Computer Science(), vol 5591. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20169-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20169-1_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20168-4

  • Online ISBN: 978-3-642-20169-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation