Skip to main content

Linguistic Facts as Predicates over Ranges of the Sentence

  • Conference paper
Logical Aspects of Computational Linguistics (LACL 2005)

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

Abstract

This paper introduces a novel approach to language processing, in which linguistic facts are represented as predicates over ranges of the intput text, usually, but not limited to, ranges of the current sentence. Such an approch allows to build non-linear analyses with a polynomial parsing complexity that take into account simultaneously and with the same technical status morphological, syntactical and semantical properties, this list being non limitative. Classical analyses, such as constituency trees, dependency graphs, topological boxes and predicate-arguments semantics are then obtained as partial projection of a complete analysis. The formalism presented here is based upon Range Concatenation Grammars (hereafter RCG), and has been successfully implemented, thanks to a previously existing RCG parser and a syntactico-semantical grammar for French.

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

Access this chapter

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. Dahl, V., Tarau, P., Huang, Y.-N.: Datalog Grammars. In: GULP-PRODE, vol.Ā 2, pp. 268ā€“282 (1994)

    Google ScholarĀ 

  2. Blache, P.: Parsing with Constraint Graphs: a Flexible Representation for Robust Parsing. In: Di Sciullo, A.M. (ed.) Grammars and NLP. LNCS, Springer, Heidelberg (2001)

    Google ScholarĀ 

  3. Boullier, P.: Range Concatenation Grammars. In: Bunt, H., Carroll, J., Satta, G. (eds.) New developments in parsing technology, pp. 269ā€“289. Kluwer Academic Publishers, Dordrecht (2004)

    Google ScholarĀ 

  4. Boullier, P.: Counting with range concatenation grammars. Theoretical Computer ScienceĀ 293, 391ā€“416 (2003)

    ArticleĀ  MATHĀ  MathSciNetĀ  Google ScholarĀ 

  5. Sagot, B., Boullier, P.: Les RCG comme formalisme grammatical pour la linguistique. In: Proceedings of TALN 2004, Fez, Marocco, pp. 403ā€“412 (2004)

    Google ScholarĀ 

  6. Pollard, C., Sag, I.A.: Head-Driven Phrase Structure Grammar. University of Chicago Press and CSLI Publications (1994)

    Google ScholarĀ 

  7. BarthĆ©lĆ©my, F., Boullier, P., Deschamp, P., de La Clergerie, Ɖ.V.: Guided Parsing of Range Concatenation Languages. In: Proceedings of ACL 2001, Toulouse, France, pp. 42ā€“49 (2001)

    Google ScholarĀ 

  8. Danlos, L., Laurens, O.: PrĆ©sentation du Projet Eurotra et des grammaires dā€™Eurotra-France. Technical Report no. 1, UniversitĆ© Paris 7 - Talana/LISH (1991)

    Google ScholarĀ 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sagot, B. (2005). Linguistic Facts as Predicates over Ranges of the Sentence. In: Blache, P., Stabler, E., Busquets, J., Moot, R. (eds) Logical Aspects of Computational Linguistics. LACL 2005. Lecture Notes in Computer Science(), vol 3492. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11422532_18

Download citation

  • DOI: https://doi.org/10.1007/11422532_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25783-7

  • Online ISBN: 978-3-540-31953-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics