Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Donkey sentence

From Wikipedia, the free encyclopedia
(Redirected fromDonkey anaphora)
Sentence that resists simple formalization

Insemantics, adonkey sentence is a sentence containing apronoun which is semanticallybound but syntactically free. They are a classic puzzle informal semantics andphilosophy of language because they are fullygrammatical and yet defy straightforward attempts to generate theirformal language equivalents. In order to explain how speakers are able to understand them, semanticists have proposed a variety of formalisms including systems ofdynamic semantics such asDiscourse representation theory. Their name comes from the example sentence "Every farmer who owns a donkey beats it", in which "it" acts asa donkey pronoun because it is semantically but not syntactically bound by the indefinitenoun phrase "a donkey". The phenomenon is known asdonkey anaphora.[a]

Examples

[edit]

The following sentences are examples of donkey sentences.

  • Omne homo habens asinum videt illum. ("Every man who owns a donkey sees it") —Walter Burley (1328),De puritate artis logicae tractatus longior[3][4]
  • Every farmer who owns a donkey beats it.[5]
  • If a farmer owns a donkey, he beats it.
  • Every police officer who arrested a murderer insulted him."

Analysis of donkey sentences

[edit]

The goal offormal semantics is to show how sentences of anatural language such asEnglish could be translated into a formal logical language, and so would then be amenable to mathematical analysis. FollowingRussell, it is typical to translateindefinite noun phrases using anexistential quantifier,[6]as in the following simple example from Burchardtet al:

"A woman smokes." is translated asx(WOMAN(x)SMOKES(x)){\displaystyle \exists x\,({\text{WOMAN}}(x)\land {\text{SMOKES}}(x))}[7]

The prototypical donkey sentence, "Every farmer who owns a donkey beats it.", requires careful consideration for adequate description (though reading "each" in place of "every" does simplify the formal analysis). The donkey pronoun in this case is the wordit. Correctly translating this sentence will require using auniversal quantifier for the indefinite noun phrase "a donkey", rather than the expected existential quantifier.

The naive first attempt at translation given below is not a well-formed sentence, since the variabley{\displaystyle y} is leftfree in the predicateBEAT(x,y){\displaystyle {\text{BEAT}}(x,y)}.[8]

x(FARMER(x)y(DONKEY(y)OWNS(x,y))BEAT(x,y)){\displaystyle \forall x\,({\text{FARMER}}(x)\land \exists y\,({\text{DONKEY}}(y)\land {\text{OWNS}}(x,y))\rightarrow {\text{BEAT}}(x,y))}

It may be attempted to extend thescope of the existential quantifier to bind the free instance ofy{\displaystyle y}, but it still does not give a correct translation.[8]

xy(FARMER(x)DONKEY(y)OWNS(x,y)BEAT(x,y)){\displaystyle \forall x\,\exists y\,({\text{FARMER}}(x)\land {\text{DONKEY}}(y)\land {\text{OWNS}}(x,y)\rightarrow {\text{BEAT}}(x,y))}

This translation is incorrect since it is already true if there exists any object that is not a donkey: Given any object to be substituted forx{\displaystyle x}, substituting any non-donkey object fory{\displaystyle y} makes thematerial conditional true (since itsantecedent is false), and so existential clause is true for every choice ofx{\displaystyle x}.

A correct translation into first-order logic for the donkey sentence seems to be

xy((FARMER(x)DONKEY(y)OWNS(x,y))BEAT(x,y)){\displaystyle \forall x\,\forall y\,(({\text{FARMER}}(x)\land {\text{DONKEY}}(y)\land {\text{OWNS}}(x,y))\rightarrow {\text{BEAT}}(x,y))},

indicating that indefinites must sometimes be interpreted as existential quantifiers, and other times as universal quantifiers.[8]

There is nothing wrong with donkey sentences: they are grammatically correct, they are well-formed and meaningful, and their syntax is regular. However, it is difficult to explain how donkey sentences produce their semantic results, and how those results generalize consistently with all other language use. If such an analysis were successful, it might allow a computer program to accurately translate natural language forms intological form.[9] It is unknown how natural language users agree – apparently effortlessly – on the meaning of sentences such as the examples.[citation needed]

There may be several equivalent ways of describing this process. In fact,Hans Kamp (1981) andIrene Heim (1982) independently proposed very similar accounts in different terminology, which they calleddiscourse representation theory (DRT) andfile change semantics (FCS), respectively.

Theories of donkey anaphora

[edit]

It is usual to distinguish two main kinds of theories about the semantics of donkey pronouns. The most classical proposals fall within the so-calleddescription-theoretic approach, a label that is meant to encompass all the theories that treat the semantics of these pronouns as akin to, or derivative from, the semantics ofdefinite descriptions. The second main family of proposals goes by the namedynamic theories, and they model donkey anaphora – and anaphora in general – on the assumption that the meaning of a sentence lies in its potential to change the context (understood as the information shared by the participants in a conversation).[10]

Description-theoretic approaches

[edit]
[icon]
This sectionneeds expansion. You can help byadding to it.(March 2020)

Description-theoretic approaches are theories of donkey pronouns in which definite descriptions play an important role. They were pioneered byGareth Evans's E-type approach,[11] which holds that donkey pronouns can be understood as referring terms whose reference is fixed by description.

For example, in "Every farmer who owns a donkey beats it.", the donkey pronoun "it" can be expanded as a definite description to yield "Every farmer who owns a donkey beats the donkey he/she owns." This expanded sentence can be interpreted along the lines of Russell'stheory of descriptions.[12]

Later authors have attributed an even larger role to definite descriptions, to the point of arguing that donkey pronouns have the semantics,[13][14] and even the syntax,[15] of definite descriptions. Approaches of the latter kind are usually calledD-type.

Discourse representation theory

[edit]
This sectionneeds additional citations forverification. Please helpimprove this article byadding citations to reliable sources in this section. Unsourced material may be challenged and removed.(January 2023) (Learn how and when to remove this message)

Donkey sentences became a major force in advancingsemantic research in the 1980s, with the introduction ofdiscourse representation theory (DRT). During that time, an effort was made to settle the inconsistencies which arose from the attempts to translate donkey sentences intofirst-order logic.

The solution thatDRT provides for the donkey sentence problem can be roughly outlined as follows: The common semantic function of non-anaphoricnoun phrases is the introduction of a newdiscourse referent, which is in turn available for the binding of anaphoric expressions. No quantifiers are introduced into the representation, thus overcoming the scope problem that the logical translations had.

Dynamic Predicate Logic

[edit]
[icon]
This sectionneeds expansion. You can help byadding to it.(March 2020)

Dynamic Predicate Logic models pronouns asfirst-order logicvariables, but allows quantifiers in aformula to bind variables in other formulae.[16]

History

[edit]

Walter Burley, a medieval scholastic philosopher, introduced donkey sentences in the context of the theory ofsupposition theory, the medieval equivalent of reference theory.

Peter Geach reintroduced donkey sentences as acounterexample toRichard Montague's proposal for a generalized formal representation ofquantification innatural language.[5] His example was reused byDavid Lewis (1975),[17]Gareth Evans (1977)[11] and many others, and is still quoted in recent publications.

See also

[edit]

References

[edit]
  1. ^Maier, Emar (20 Nov 2006)."Situations and Individuals by Paul D. Elbourne".LINGUIST List (review).17 (3393).
  2. ^Barker, Chris; Shan, Chung-chieh (9 June 2008)."Donkey anaphora is in-scope binding".Semantics and Pragmatics.1 (1):1–46.doi:10.3765/sp.1.1.ISSN 1937-8912. Retrieved29 December 2020.
  3. ^Gualterus Burlaeus (1988).De puritate artis logicae tractatus longior. Meiner Verlag.ISBN 9783787307173.
  4. ^Keith Allan (2010).Concise Encyclopedia of Semantics. Elsevier.ISBN 9780080959696.
  5. ^abPeter Geach (1962).Reference and Generality. Ithaca and London: Cornell University Press – via philosophieweb0.001.free.fr/GeachRandG.pdf.
  6. ^Heim, Irene (1982).The Semantics of Definite and Indefinite Noun Phrases(PDF) (PhD). University of Massachusetts Amherst. pp. 11–12. Retrieved29 December 2020.
  7. ^Burchardt, Aljoscha; Walter, Stephan; Koller, Alexander;Kohlhase, Michael; Blackburn, Patrick; Bos, Johan."Anaphoric Pronouns".Computational Semantics 11.1.1. Saarland University. Retrieved29 December 2020.
  8. ^abcBurchardt, Aljoscha; Walter, Stephan; Koller, Alexander; Kohlhase, Michael; Blackburn, Patrick; Bos, Johan."Donkey Sentences".Computational Semantics 11.1.2. Saarland University. Retrieved29 December 2020.
  9. ^Knott, Alistair (2000)."An Algorithmic Framework for Specifying the Semantics of Discourse Relations"(PDF).Computational Intelligence.16 (4):501–510.doi:10.1111/0824-7935.00123.S2CID 1295252.
  10. ^Elbourne, Paul (2005).Situations and individuals. MIT Press.ISBN 9780262550611.
  11. ^abEvans, Gareth (September 1977). "Pronouns, Quantifiers and Relative Clauses (I)".Canadian Journal of Philosophy.7 (3):467–536.doi:10.1080/00455091.1977.10717030.S2CID 146125231.
  12. ^Partee, Barbara H. (18 March 2008)."Formal Semantics and Current Problems of Semantics, Lecture 6. Kamp-Heim I. Anaphora with Indefinite Antecedents; Donkey Anaphora"(PDF).RGGU: Formal Semantics and Anaphora. University of Massachusetts. p. 9. Retrieved29 December 2020.
  13. ^Cooper, Robin (1979). "The interpretation of pronouns". In Frank Heny; Helmut Schnelle (eds.).Syntax and Semantics 10: Selections from the third Gröningen roundtable. Academic Press.ISBN 012613510X.
  14. ^Neale, Stephen (1990).Descriptions. The MIT Press.ISBN 0262640317.
  15. ^Heim, Irene;Kratzer, Angelika (1998).Semantics in Generative Grammar. Blackwell.ISBN 0631197133.
  16. ^Groenendijk, Jeroen;Stokhof, Martin (1991)."Dynamic Predicate Logic"(PDF).Linguistics and Philosophy.14:39–100.doi:10.1007/BF00628304.S2CID 62551132.
  17. ^Lewis, David (1975). "Adverbs of quantification". In Keenan, Edward L. (ed.).Formal Semantics of Natural Language. Cambridge: Cambridge University Press.ISBN 9780511897696 – via users.ox.ac.uk/~sfop0776/LewisQA.pdf.

Further reading

[edit]

Notes

[edit]
  1. ^Emar Maier describes donkey pronouns as "bound but notc-commanded" in aLinguist Listreview of Paul D. Elbourne'sSituations and Individuals (MIT Press, 2006).[1]Barker and Shan define a donkey pronoun as "a pronoun that lies outside the restrictor of aquantifier or the if-clause of aconditional, yetcovaries with somequantificational element inside it, usually anindefinite."[2]
  2. ^In 2007, Adrian Brasoveanu published studies of donkey pronoun analogs inHindi, and analysis of complex andmodal versions of donkey pronouns in English.

External links

[edit]
Lexical categories and their features
Noun
Verb
Forms
Types
Adjective
Adverb
Pronoun
Adposition
Determiner
Particle
Other
Central concepts
Topics
Areas
Phenomena
Formalism
Formal systems
Concepts
See also
Retrieved from "https://en.wikipedia.org/w/index.php?title=Donkey_sentence&oldid=1269863297"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp