Skip to main content

Some Generalised Comparative Determiners

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

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

Abstract

Functions denoted by specific comparative expressions called generalised comparative determiners are analysed. These expressions form verb arguments when applied to common nouns. They denote functions which take sets and a binary relation as argument and give a set as result. These functions are thus different from denotations of ”ordinary” determiners. However, they do obey some similar constraints, properly generalised. It is shown that verbal arguments obtained from such generalised determiners extend the expressive power of NLs since functions that they denote are not just case extensions of type 〈1〉 quantifiers used to interpret ”ordinary” determiner phrases.

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

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. Beghelli, F.: Structured Quantifiers. In: Kanazawa, M., Piñon, C. (eds.) Dynamics, Polarity, and Quantification, pp. 119–145. CSLI Publications (1994)

    Google Scholar 

  2. Keenan, E.L.: Semantic Case Theory. In: Groenendijk, J., Stokhof, M. (eds.) Sixth Amsterdam Colloquium (1987)

    Google Scholar 

  3. Keenan, E.L.: On Semantics and the Binding Theory. In: Hawkins, J. (ed.) Explaining Language Universals, pp. 105–144. Blackwell, Malden (1988)

    Google Scholar 

  4. Keenan, E.L.: On the denotations of anaphors. Research on Language and Computation 5(1), 5–17 (2007)

    Google Scholar 

  5. Keenan, E.L., Moss, L.: Generalized quantifiers and the expressive power of natural language. In: van Benthem, J., ter Meulen, A. (eds.) Generalized Quantifiers, Foris, Dordrecht, pp. 73–124 (1985)

    Google Scholar 

  6. Keenan, E.L., Westerståhl, D.: Generalized Quantifiers in Linguistics and Logic. In: van Benthem, J., ter Meulen, A. (eds.) Handbook of Logic and Language, pp. 837–893. Elsevier, Amsterdam (1997)

    Chapter  Google Scholar 

  7. Szabolcsi, A.: Comparative supelatives. In: MIT Working Papers in Linguistics, pp. 245–266 (1986)

    Google Scholar 

  8. Zuber, R.: More Algebras for Determiners. In: Blache, P., Stabler, E. (eds.) LACL 2005. LNCS (LNAI), vol. 3492, pp. 347–362. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Zuber, R.: A semantic constraint on binary determiners. Linguistics and Philosophy 32, 95–114 (2009)

    Article  Google Scholar 

  10. Zuber, R.: Generalising Conservativity. In: Dawar, A., de Queiroz, R. (eds.) WoLLIC 2010. LNCS, vol. 6188, pp. 247–258. Springer, Heidelberg (2010a)

    Chapter  Google Scholar 

  11. Zuber, R.: Semantics of Slavic anaphoric possessive determiners. In: Proceedings of SALT 19 (2010b) forthcoming

    Google Scholar 

  12. Zuber, R.: Semantic constraints on anaphoric determiners. Research on Language and Computation (2010c) forthcoming

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zuber, R. (2011). Some Generalised Comparative Determiners. In: Pogodalla, S., Prost, JP. (eds) Logical Aspects of Computational Linguistics. LACL 2011. Lecture Notes in Computer Science(), vol 6736. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22221-4_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22221-4_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22220-7

  • Online ISBN: 978-3-642-22221-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics