Refine
Year of publication
Document Type
- Conference Proceeding (10)
- Part of a Book (7)
- Working Paper (2)
Language
- English (19)
Has Fulltext
- yes (19) (remove)
Is part of the Bibliography
- no (19)
Keywords
- Anapher <Syntax> (19) (remove)
In this paper we propose an LFG/XLE treatment of Exhaustive Object Control (EOC) constructions in Greek na clauses. We draw on data retrieved from the Hellenic National Corpus (HNC) in order to define the verbs that allow EOC. We treat EOC using anaphoric control. We take the subject of the subordinate na clause (controllee) to be a PRO marked with nominative case that is anaphorically related to the object of the matrix clause (controller). We implement this analysis in our LFG/XLE Grammar by adding the new feature ANAPH_C_BY.
In this paper I introduce the notion of Usage Preferences (UPs), which are statistically significant preferences in usage which can concern any aspect of linguistics. I suggest that multiple violations of UPs can have additive effects, causing grammatical sentences to be judged as unacceptable. A new judgment on sentences is proposed, the downarrow (↓) to mark sentences that are taken to be grammatical but unacceptable due to UP violations. I illustrate the idea of UPs on the basis of a discussion of the English verbal anaphor do so, involving both a corpus analysis and two acceptability experiments. This leads to a discussion of the relationship between grammaticality and acceptability and to remarks on the methodological importance of taking UPs into account both in linguistic theorizing and in the construction of acceptability experiments.
It is known that VP-ellipsis and VP-anaphora are typologically different phenomena. English has VP-ellipses whereas Korean has VP-anaphora. The goals of this paper are (i) to develop a unified algorithm which can analyze these two different phenomena and (ii) to explain them using the developed resolution algorithm. In order to analyze these phenomena, this paper incorporates Jager's anaphora resolution mechanism (2010) into the typed feature structure formalism of Head-driven Phrase Structure Grammar (HPSG). In this paper, VP-ellipsis and VP-anaphora are analyzed as follows. First, English do and Korean kuleha-ta are introduced with the Geach value, and this value is changed with a slash-elimination rule. Then, one constituent combines with another by ordinary syntactic rules, while the information on the target predicate is percolated up. When a potential source appears, a slash-introduction rule is applied. Then, the source predicate activates the VP-resolution rule, and the target predicate is connected with the source in the semantic representations.
Korean has two types of answers shorter than full sentential answers: Fragments and null argument constructions. Apparently the two constructions have the same interpretative processes. However, there are some cases where the fragment and null argument construction behave differently: e.g., wh-puzzles, sloppy interpretation. We suggest that the two constructions involve two different types of anaphora and that the sources of sloppy(-like) interpretation are fundamentally distinct. Fragments pattern differently with null arguments in that only the former may display genuine sloppy readings. The latter may yield sloppy-like readings which are pragmatically induced by the explicature that can be cancelled unlike genuine sloppy readings in fragments. Evidence (wh-ellipsis, quantifier ellipsis) all lends substantial support to our claim that fragments are analyzed as an instance of clausal ellipsis while null arguments are analyzed as an instance of null pronoun pro; hence, the former is surface anaphora whereas the latter is deep anaphora in the sense of Hankamer & Sag (1976).
Non-restrictive relative clauses (NRRCs) can modify constituents which undergo 'pragmatic enrichment' when they appear in answers to questions. For example, in an interchange like: 'A: What did Jo think? B: That you should say nothing, which is surprising.' What B says is surprising is that 'Jo thinks ...' On the face of it, this might seem problematic for approaches to NRRCs which assume 'syntactic integration' and to support an 'orphan' analysis, where NRRCs are combined with purely conceptual representations. In this paper we examine a range of elliptical and anaphoric phenomena, and show that this conclusion is misplaced. In fact, the phenomena argue strongly in favour of a syntactically integrated analysis.
Algorithmic approaches to anaphor resolution are known to benefit substantially from syntactic disjoint reference filters. Typically, however, there is a considerable gap between the scope of the formal model of grammar employed for deriving referential evidence and its implementation. While accounting for many subtleties of language, such formal models at most partially address the algorithmic aspects of referential processing. This paper investigates the issue of implementing syntactic disjoint reference for robust anaphor resolution. An algorithmic account of binding condition verification will be developed that, on one hand, captures the theoretical subtleties, and, on the other hand, exhibits computational efficiency and fulfils the robustness requirements. Taking as input the potentially fragmentary parses of a robust state-of-the-art parser, the practical performance of this algorithm will be evaluated with respect to the task of anaphor resolution and shown to be nearly optimal.
It has been commonly assumed since Chomsky (1981) that the distribution of reflexive pronouns is subject to Binding Condition A. Reinhart and Reuland (1993) formulate Condition A in terms of the notion of syntactic predicate. The proposal I will develop in this paper is to factor out semantic and syntactic conditions on the occurrence of reflexive pronouns and to reduce them to independently motivated semantic and syntactic mechanisms. The semantic part is attributed to a theory of semantic composition recently developed by Chung and Ladusaw (2004), while the syntactic residue falls into the proper characterization of syntactic chains, as proposed by Reinhart and Reuland (1993) and Reuland (2001). To the extent that this approach is successful, Binding Condition A is rendered superfluous.
On binding domains
(2005)
In this paper I want to explore reasons for replacing Binding Theory based on the anaphor-pronoun dichotomy by a Binding Theory allowing more domains restricting/defining anaphoric dependencies. This will, thus, have consequences for the partitioning of anaphoric elements, presupposing more types of 'anaphors'/'pronouns' than standard Binding Theory offers us.
Departing from the exhaustive indexation, syntax-driven approach to binding, we argued for an alternative, semantics-oriented rationale for binding principles. Under this new understanding of the nature of grammatical constraints on anaphoric binding, these principles are viewed as contributing to circumscribe the contextually determined semantic value of anaphoric nominals. This conceptual shift helps to find a fully fledged formal specification of binding principles with the HPSG lean description formalism where these constraints are entered in the grammar as part of the information kept at the lexical entries of anaphoric expressions.
This paper discusses the behavior of picture NP reflexives in German and English. Taking the analysis of Pollard/Sag (1994) as a starting point, we show that their main conclusion for English, viz. that picture NP reflexives are exempt from Principle A, does not apply to German. As a first step, we present an alternative formulation of Principle A for German. But the principles proposed for German and English do not offer any explanation for the universal behavior of anaphors if they cannot be related to each other. We thusn propose a more general Principle A to hold universally. Individual, language-specific instantiations of this Principle A are derived from determining certain parameter settings.