Skip to main content
SpringerLink
Log in

Eliminating Ditransitives

  • Conference paper
Formal Grammar (FG 2010, FG 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7395))

Abstract

We discuss how higher arity verbs such as give or promise can be treated in an algebraic framework that admits only unary and binary relations and does not rely on event variables.

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.

References

  • Anderson, J.: Modern grammars of case: a retrospective. Oxford University Press (2006)

    Google Scholar 

  • Andrews, A.: Model-theoretic semantics as structural semantics. ms, ANU (2003)

    Google Scholar 

  • Boguraev, B.K., Briscoe, E.J.: Computational Lexicography for Natural Language Processing. Longman (1989)

    Google Scholar 

  • Brachman, R.: On the epistemological status of semantic networks (1979)

    Google Scholar 

  • Brachman, R., Levesque, H.: Readings in knowledge representation. Kaufman Publishers Inc., Los Altos (1985)

    MATH  Google Scholar 

  • Curry, H.B.: Some logical aspects of grammatical structure. In: Jakobson, R. (ed.) Structure of Language and its Mathematical Aspects, pp. 56–68. American Mathematical Society, Providence (1961)

    Google Scholar 

  • Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press (1974)

    Google Scholar 

  • Findler, N.: Associative Networks: Representation and Use of Knowledge by Computers. Academic Press (1979)

    Google Scholar 

  • Fodor, J.: Three reasons for not deriving “kill” from “cause to die”. Linguistic Inquiry 1(4), 429–438 (1970)

    Google Scholar 

  • Graham, A.C.: Two Chinese Philosophers, London (1958)

    Google Scholar 

  • Jackendoff, R.S.: Semantic Structures. MIT Press (1990)

    Google Scholar 

  • Jacobson, P.: Towards a variable-free semantics. Linguistics and Philosophy 22, 117–184 (1999)

    Article  Google Scholar 

  • Kiparsky, P.: On the Architecture of {P}\={a}\d{n}ini’s grammar. ms, Stanford University (2002)

    Google Scholar 

  • Kornai, A.: Mathematical Linguistics. Springer (2008)

    Google Scholar 

  • Kornai, A.: The algebra of lexical semantics. In: Jäger, G., Michaelis, J. (eds.) Proceedings of the 11th Mathematics of Language Workshop. FoLLI Lecture Notes in Artificial Intelligence. Springer (2010a)

    Google Scholar 

  • Kornai, A.: The treatment of ordinary quantification in English proper. Hungarian Review of Philosophy 54(4), 150–162 (2010b)

    Google Scholar 

  • Lakoff, G.: Pronouns and reference (1968)

    Google Scholar 

  • Lewis, D.: General semantics. Synthese 22(1), 18–67 (1970)

    Article  MATH  Google Scholar 

  • Marsh, W., Partee, B.: How non-context-free is variable binding? In: Cobler, M., MacKaye, S., Wescoat, M. (eds.) Proceedings of the West Coast Conference on Formal Linguistics III, pp. 179–190 (1984)

    Google Scholar 

  • Pike, K.: Language in Relation to a Unified Theory of the Structure of Human Behavior. Mouton, The Hague (1960)

    Google Scholar 

  • Pollard, C.: Hyperintensions. Journal of Logic and Computation 18(2), 257–282 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  • Quillian, M.R.: The teachable language comprehender. Communications of the ACM 12, 459–476 (1969)

    Article  Google Scholar 

  • Rawls, J.: Two concepts of rules. The Philosophical Review 64(1), 3–32 (1955)

    Article  Google Scholar 

  • Roeper, T.: Implict arguments and the head-complement relation. Linguistic Inquiry 18, 267–310 (1987)

    Google Scholar 

  • Russell, B.: The Philosophy of Leibniz. Allen und Andwin (1900)

    Google Scholar 

  • Schank, R.: The Fourteen Primitive Actions and Their Inferences. Stanford AI Lab Memo 183 (1973)

    Google Scholar 

  • Sichel, I.: New evidence for the structural realization of the implicit external argument in nominalizations. Linguistic Inguiry 40(4), 712–723 (2009)

    Article  Google Scholar 

  • Somers, H.L.: Valency and case in computational linguistics. Edinburgh University Press (1987)

    Google Scholar 

  • Sowa, J.: Knowledge representation: logical, philosophical, and computational foundations, vol. 594. MIT Press (2000)

    Google Scholar 

  • Steedman, M.: The Syntactic Process. MIT Press (2001)

    Google Scholar 

  • Szabolcsi, A.: Bound variables in syntax – are there any? In: Gronendijk, J., Stokhof, M., Veltman, F. (eds.) Proceedings of the 6th Amsterdam Colloquium. Institute for Language, Logic, and Information, Amsterdam, pp. 331–351 (1987)

    Google Scholar 

  • Talmy, L.: Force dynamics in language and cognition. Cognitive Science 12(1), 49–100 (1988)

    Article  Google Scholar 

  • Turner, R.: Montague semantics, nominalisations and Scott’s domains. Linguistics and Philosophy 6, 259–288 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  • Turner, R.: Three theories of nominalized predicates. Studia Logica 44(2), 165–186 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  • Wierzbicka, A.: Lexicography and conceptual analysis. Karoma, Ann Arbor (1985)

    Google Scholar 

  • Woods, W.A.: What’s in a link: Foundations for semantic networks. Representation and Understanding: Studies in Cognitive Science, 35–82 (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Quantitative Social Science, Harvard University, USA

    András Kornai

  2. Computer and Automation Research Institute, Hungarian Academy of Sciences, Hungary

    András Kornai

Authors
  1. András Kornai
    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-ls-Nancy, France

    Philippe de Groote

  2. School of Computer Science, University of St. Andrews, North Haugh, St. Andrews, KY16 9SX, Fife, Scotland

    Mark-Jan Nederhof

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kornai, A. (2012). Eliminating Ditransitives. In: de Groote, P., Nederhof, MJ. (eds) Formal Grammar. FG FG 2010 2011. Lecture Notes in Computer Science, vol 7395. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32024-8_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32024-8_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32023-1

  • Online ISBN: 978-3-642-32024-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation