24,947 research outputs found
Sloppy Identity
Although sloppy interpretation is usually accounted for by theories of
ellipsis, it often arises in non-elliptical contexts. In this paper, a theory
of sloppy interpretation is provided which captures this fact. The underlying
idea is that sloppy interpretation results from a semantic constraint on
parallel structures and the theory is shown to predict sloppy readings for
deaccented and paycheck sentences as well as relational-, event-, and
one-anaphora. It is further shown to capture the interaction of sloppy/strict
ambiguity with quantification and binding.Comment: 20 page
Sloppy identity unbound
Reinhart (1983) claims that only pronouns whose antecedents c-command them may give rise to sloppy identity readings. This paper presents counterexamples to this claim; for instance, referring to the famous 1960 televised presidential debate, it is acceptable to say: "Kennedy looked good. People voted for him. Nixon looked bad. People didn't." Despite the fact that the antecedent "Kennedy" for the pronoun "him" is in a previous sentence, this pronoun allows a sloppy identity reading wherein the fourth sentence ("People didn't.") means that people didn't vote for Nixon. To analyze such cases, I first propose an extension to the ~ focus operator due to Rooth (1992), allowing this operator to alter the assignment function used
to interpret pronouns. One construction where Rooth places ~ is in the answers to questions. My new meaning for ~ explains why pronouns are so constrained in answers, e.g., "Who does John like? He[=John] likes Mary." Next, I argue for the Question-Under-Discussion (QUD) model of discourse described in Roberts (1996), which theorizes that every sentence is the answer to an explicit or implicit question. Finally, I show that unbound sloppy identity can be analyzed as cases where pronouns are constrained by antecedents in implicit questions. Along the way, I argue that the QUD model is compatible with the coherence relation model of discourse due to Hobbs (1979), explaining how coherence can constrain pronoun reference as well
Sloppy Identity in Chinese Sluicing-like Constructions
Concerning the nature of sluicing-like constructions in Chinese, this thesis examines two competing analyses proposed in the literature: the pseudo-sluicing analysis and the PF-deletion (sluicing) analysis. It shows that both analyses fail to reconcile with the presence of the copula shi as well as the sloppy reading found in Chinese sluicing-like constructions. It also observes that the sloppy reading and the copula shi are in complementary distributionâconstructions with the copular shi are unable to be associated with sloppy readings. With respect to such facts, this thesis suggests to divide Chinese sluicing-like constructions into two distinct syntactic structures, namely pseudo-sluicing (for those with the copula shi) and sluicing (for those without the copula shi). Further, this thesis manages to fix the difficulty in creating the environment for PF-deletion in sluicing by suggesting that the wh-phrase moves to the left periphery through topicalization. Discussions on problems proposed in the literature are also included
The semantics of ellipsis
There are four phenomena that are particularly troublesome for theories of ellipsis: the existence of sloppy readings when the relevant pronouns cannot possibly be bound; an ellipsis being resolved in such a way that an ellipsis site in the antecedent is not understood in the way it was there; an ellipsis site drawing material from two or more separate antecedents; and ellipsis with no linguistic antecedent. These cases are accounted for by means of a new theory that involves copying syntactically incomplete antecedent material and an analysis of silent VPs and NPs that makes them into higher order definite descriptions that can be bound into
Sloppy Identity, Binding, and Centering
No abstract
Hardt's surprising sloppy readings : a flat binding account
The paper presents an additional argument for a specific account of semantic binding: the flat-binding analysis. The argument is based on observations concerning sloppy interpretations in verb phrase ellipsis when the binder is not the subject of the elided VP. In one such case, it is important that one of the binders belong to the domain of the other. This case can be derived from the flat-binding analysis as is shown in the paper, while it is unclear how to account for it within other analyses of semantic binding
Universality of spectra for interacting quantum chaotic systems
We analyze a model quantum dynamical system subjected to periodic interaction
with an environment, which can describe quantum measurements. Under the
condition of strong classical chaos and strong decoherence due to large
coupling with the measurement device, the spectra of the evolution operator
exhibit an universal behavior. A generic spectrum consists of a single
eigenvalue equal to unity, which corresponds to the invariant state of the
system, while all other eigenvalues are contained in a disk in the complex
plane. Its radius depends on the number of the Kraus measurement operators, and
determines the speed with which an arbitrary initial state converges to the
unique invariant state. These spectral properties are characteristic of an
ensemble of random quantum maps, which in turn can be described by an ensemble
of real random Ginibre matrices. This will be proven in the limit of large
dimension.Comment: 11 pages, 10 figure
The geometry of nonlinear least squares with applications to sloppy models and optimization
Parameter estimation by nonlinear least squares minimization is a common
problem with an elegant geometric interpretation: the possible parameter values
of a model induce a manifold in the space of data predictions. The minimization
problem is then to find the point on the manifold closest to the data. We show
that the model manifolds of a large class of models, known as sloppy models,
have many universal features; they are characterized by a geometric series of
widths, extrinsic curvatures, and parameter-effects curvatures. A number of
common difficulties in optimizing least squares problems are due to this common
structure. First, algorithms tend to run into the boundaries of the model
manifold, causing parameters to diverge or become unphysical. We introduce the
model graph as an extension of the model manifold to remedy this problem. We
argue that appropriate priors can remove the boundaries and improve convergence
rates. We show that typical fits will have many evaporated parameters. Second,
bare model parameters are usually ill-suited to describing model behavior; cost
contours in parameter space tend to form hierarchies of plateaus and canyons.
Geometrically, we understand this inconvenient parametrization as an extremely
skewed coordinate basis and show that it induces a large parameter-effects
curvature on the manifold. Using coordinates based on geodesic motion, these
narrow canyons are transformed in many cases into a single quadratic, isotropic
basin. We interpret the modified Gauss-Newton and Levenberg-Marquardt fitting
algorithms as an Euler approximation to geodesic motion in these natural
coordinates on the model manifold and the model graph respectively. By adding a
geodesic acceleration adjustment to these algorithms, we alleviate the
difficulties from parameter-effects curvature, improving both efficiency and
success rates at finding good fits.Comment: 40 pages, 29 Figure
- âŚ