The Experts below are selected from a list of 234 Experts worldwide ranked by ideXlab platform

Chung-hye Han - One of the best experts on this subject based on the ideXlab platform.

  • C-command vs. scope: An experimental assessment of Bound-Variable pronouns
    Language, 2018
    Co-Authors: Keir Moulton, Chung-hye Han
    Abstract:

    While there are very clearly some structural constraints on pronoun interpretation, debate remains as to their extent and proper formulation (Bruening 2014). Since Reinhart 1976 it has commonly been reported that Bound-Variable pronouns are subject to a c-command requirement. This claim is not universally agreed upon and has recently been challenged by Barker (2012), who argues that Bound pronouns must merely fall within the semantic scope of a binding quantifier. In the processing literature, recent results have been advanced in support of c-command (Cunnings et al. 2015, Kush et al. 2015). However, none of these studies separates semantic scope from structural c-command. In this article, we present two self-paced reading studies and one off-line judgment task which show that when we put both c-commanding and non-c-commanding quantifiers on an equal footing with regard to their ability to scope over a pronoun, we nonetheless find a processing difference between the two. Semantically legitimate but non-c-commanded Bound Variables do not behave like c-commanded Bound Variables in their search for an antecedent. The results establish that c-command, not scope alone, is relevant for the processing of Bound Variables. We then explore how these results, combined with other experimental findings, support a view in which the grammar distinguishes between c-commanded and non-c-commanded Variable pronouns, the latter perhaps being disguised definite descriptions (Cooper 1979, Evans 1980, Heim 1990, Elbourne 2005).

  • Using synchronous tree adjoining grammar to model the typology of Bound Variable pronouns
    Journal of Logic and Computation, 2013
    Co-Authors: Dennis Ryan Storoshenko, Chung-hye Han
    Abstract:

    This paper presents a novel analysis of Bound Variable anaphora using Synchronous Tree Adjoining Grammar (STAG), a pairing of a Tree Adjoining Grammar (TAG) for syntax and a TAG for semantics. While a Bound Variable pronoun can occur at a distance from its binder, as in ‘Every girli believes that shei is intelligent,’ languages vary, though in a limited way, as to how near or far from its binder a Bound Variable should be. As any dependency between two syntactic objects must be localized to a single predicate domain in TAG, modelling Bound Variable anaphora in syntax and semantics poses an interesting challenge for STAG. In our analysis, Bound Variable pronouns are represented as Multi-Component sets in both syntax and semantics, composing in delayed tree-local derivations. This allows us to not only account for Variable binding at a distance, but it also allows us to define a single derivational parameter from which observed patterns of Bound Variable locality can be derived, ruling out unobserved patterns, capturing the range of interpretive possibilities for Bound Variable pronouns across languages.

  • A Bound-Variable Analysis of the Korean Anaphor caki: Evidence from Corpus *
    2007
    Co-Authors: Chung-hye Han, Dennis Ryan Storoshenko, Canada
    Abstract:

    We consider the binding-theoretic status of the Korean long-distance anaphor caki. After examining competing analyses, including the cyclic head movement account for longdistance anaphors (Cole et al., 1990) and the treatment of caki as a pronoun, we argue that caki is a Bound Variable. We show how this Bound Variable account can unify local, longdistance, and discourse-Bound instances of caki. Furthermore, we present the results of a corpus study, the findings of which are twofold. Firstly, we find support for our analysis in that the majority of instances of caki fit the Bound Variable account. Secondly, by broadening our analysis to find alternative means of binding caki, we are able to capture purported counterexamples within our Bound Variable analysis.

  • a Bound Variable analysis of the korean anaphor caki evidence from corpus
    2007
    Co-Authors: Chung-hye Han, Dennis Ryan Storoshenko
    Abstract:

    We consider the binding-theoretic status of the Korean long-distance anaphor caki. After examining competing analyses, including the cyclic head movement account for longdistance anaphors (Cole et al., 1990) and the treatment of caki as a pronoun, we argue that caki is a Bound Variable. We show how this Bound Variable account can unify local, longdistance, and discourse-Bound instances of caki. Furthermore, we present the results of a corpus study, the findings of which are twofold. Firstly, we find support for our analysis in that the majority of instances of caki fit the Bound Variable account. Secondly, by broadening our analysis to find alternative means of binding caki, we are able to capture purported counterexamples within our Bound Variable analysis.

Eelco Visser - One of the best experts on this subject based on the ideXlab platform.

  • Fundamenta Informaticae Draft 2004 1–73 1 IOS Press Program Transformation with Scoped Dynamic Rewrite Rules
    2015
    Co-Authors: Martin Bravenboer, Arthur Van Dam, Karina Olmos, Eelco Visser
    Abstract:

    Abstract. The applicability of term rewriting to program transformation is limited by the lack of control over rule application and by the context-free nature of rewrite rules. The first problem is addressed by languages supporting user-definable rewriting strategies. The second problem is ad-dressed by the extension of rewriting strategies with scoped dynamic rewrite rules. Dynamic rules are defined at run-time and can access Variables available from their definition context. Rules defined within a rule scope are automatically retracted at the end of that scope. In this paper we explore the design space of dynamic rules, their application to transformation problems, and their implemen-tation. The technique is formally defined by extending the operational semantics underlying the program transformation language Stratego, and illustrated by means of several program tranforma-tions in Stratego, including constant propagation, Bound Variable renaming, dead code elimination, function inlining, and function specialization. 1

  • Program Transformation with Scoped Dynamic Rewrite Rules
    Fundamenta Informaticae, 2006
    Co-Authors: Martin Bravenboer, Arthur Van Dam, Karina Olmos, Eelco Visser
    Abstract:

    The applicability of term rewriting to program transformation is limited by the lack of control over rule application and by the context-free nature of rewrite rules. The first problem is addressed by languages supporting user-definable rewriting strategies. The second problem is addressed by the extension of rewriting strategies with scoped dynamic rewrite rules. Dynamic rules are defined at run-time and can access Variables available from their definition context. Rules defined within a rule scope are automatically retracted at the end of that scope. In this paper, we explore the design space of dynamic rules, and their application to transformation problems. The technique is formally defined by extending the operational semantics underlying the program transformation language Stratego, and illustrated by means of several program transformations in Stratego, including constant propagation, Bound Variable renaming, dead code elimination, function inlining, and function specialization.

  • Scoped Dynamic Rewrite Rules
    Electronic Notes in Theoretical Computer Science, 2001
    Co-Authors: Eelco Visser
    Abstract:

    The applicability of term rewriting to program transformation is limited by the lack of control over rule application and by the context-free nature of rewrite rules. The rst problem is addressed by languages supporting user-denable rewriting strategies. This paper addresses the second problem by extending rewriting strategies with scoped dynamic rewrite rules. Dynamic rules are generated at run-time and can access Variables available from their denition context. Rules generated within a rule scope are automatically retracted at the end of that scope. The technique is illustrated by means of several program tranformations: Bound Variable renaming, function inlining, and dead function elimination.

Colin Phillips - One of the best experts on this subject based on the ideXlab platform.

  • Relation-sensitive retrieval: Evidence from Bound Variable pronouns
    Journal of Memory and Language, 2015
    Co-Authors: Dave Kush, Jeffrey Lidz, Colin Phillips
    Abstract:

    Formal grammatical theories make extensive use of syntactic relations (e.g. c-command, Reinhart, 1983) in the description of constraints on antecedent-anaphor dependencies. Recent research has motivated a model of processing that exploits a cue-based retrieval mechanism in content-addressable memory (e.g. Lewis, Vasishth, & Van Dyke, 2006) in which item-to-item syntactic relations such as c-command are difficult to use as retrieval cues. As such, the c-command constraints of formal grammars are predicted to be poorly implemented by the retrieval mechanism. We tested whether memory access mechanisms are able to exploit relational information by investigating the processing of Bound Variable pronouns, a form of anaphoric dependency that imposes a c-command restriction on antecedent-pronoun relations. A quantificational NP (QP, e.g., no janitor) must c-command a pronoun in order to bind it. We contrasted the retrieval of QPs with the retrieval of referential NPs (e.g. the janitor), which can co-refer with a pronoun in the absence of c-command. In three off-line judgment studies and two eye-tracking studies, we show that referential NPs are easily accessed as antecedents, irrespective of whether they c-command the pronoun, but that quantificational NPs are accessed as antecedents only when they c-command the pronoun. These results are unexpected under theories that hold that retrieval exclusively uses a limited set of content features as retrieval cues. Our results suggest either that memory access mechanisms can make use of relational information as a guide for retrieval, or that the set of features that is used to encode syntactic relations in memory must be enriched.

Nouman Malkawi - One of the best experts on this subject based on the ideXlab platform.

  • Weak versus strong resumption
    2011
    Co-Authors: Nicolas Guilliot, Nouman Malkawi
    Abstract:

    This article focuses on the distribution and interpretation of resumption in Jordanian Arabic with respect to a well-known distinction: weak (clitics and doubled pronouns) versus strong (strong pronouns and epithets) resumption. We propose an analysis of resumption and reconstruction that relates two major asymmetries with respect to that distinction, (i) strong resumption banning QP antecedents in non-island contexts, contrary to weak resumption, and (ii) strong resumption banning reconstruction in strong island contexts, contrary to weak resumption. Our main conclusion is that weak (functional) resumptives support two distributive readings, either Bound Variable or e - type, whereas strong (lexical) resumptives can only get an e -type interpretation. The asymmetries stated above then just follow from further constraints on the two distributive readings.

  • Weak versus Strong Resumption: covarying differently
    2011
    Co-Authors: Nicolas Guilliot, Nouman Malkawi
    Abstract:

    This article focuses on the distribution and interpretation of resumption in Jordanian Arabic with respect to a well-known distinction: weak (clitics and doubled pronouns) versus strong (strong pronouns and epithets) resumption. We propose an analysis of resumption and reconstruction that relates two major asymmetries with respect to that distinction, (i) strong resumption banning QP antecedents in non-island contexts, contrary to weak resumption, and (ii) strong resumption banning reconstruction in strong island contexts, contrary to weak resumption. Our main conclusion is that weak (functional) resumptives support two distributive readings, either Bound Variable or e-type, whereas strong (lexical) resumptives can only get an e-type interpretation. The asymmetries stated above then just follow from further constraints on the two distributive readings.

Ann Nanteza - One of the best experts on this subject based on the ideXlab platform.

  • experimental production of anti membrane Bound Variable surface glycoglycoprotein anti vsgm antibodies for in vitro and in situ immunostaining of pathogenic african trypanosomes
    bioRxiv, 2020
    Co-Authors: Ann Nanteza, Reymick Okwongoketch, Julius Nsubuga, Peter Ayebare, Zachary Nsadha, George W Lubega
    Abstract:

    Background: The variant surface glycoprotein (VSG) of the African trypanosomes is the major membrane protein of the plasma membrane of the bloodstream stage of the parasite. African trypanosomiasis (sleeping sickness in humans and nagana in animals) is caused by the systemic infection of the host by several sub-species of the extracellular haemoflagellate protozoa under genus Trypanosoma. As a defense barrier against the host immune response, the entire surface of the bloodstream form of trypanosome is covered with densely packed molecules of VSG that determines the antigenic phenotype of the parasite. Variant surface glycoprotein has a C-terminal domain that is highly conserved in various species of trypanosomes. Methods: The membrane Bound VSG (VSGm) protein was prepared without denaturing the homologous region and by including numerous Variable antigen types from Trypanosoma brucei brucei parasites. The purified VSGm native trypanosome protein was used to produce anti-VSGm immune sera in rabbits. The indirect immunofluorescence assay (IFA) was used to detect trypanosomes from mice blood, artificial culture media and cattle histological sections. Results: The resultant immune sera were able to detect different strains and species of African trypanosomes from in vivo and in situ sources after immunostaining. Anti-VSGm antibodies also demonstrated a unique property to locate trypanosomes within the histological tissues even after the trypanosome9s morphology had been distorted. Conclusion: The produced immune sera can be utilized for immunohistochemistry to detect Trypanosoma species in various fluids and tissues.

  • experimental production of anti membrane Bound Variable surface glycoglycoprotein anti vsgm antibodies for in vitro and in situ immunostaining of pathogenic african
    Stroke Research & Therapy, 2020
    Co-Authors: Reymick Okwongoketch, Julius Nsubuga, Peter Ayebare, Zachary Nsadha, George W Lubega, Ann Nanteza
    Abstract:

    Background: The variant surface glycoprotein (VSG) of the African trypanosomes is the major membrane protein of the plasma membrane of the bloodstream stage of the parasite. African trypanosomiasis (sleeping sickness in humans and nagana in animals) is caused by the systemic infection of the host by several subspecies of the extracellular haemoflagellate protozoa under genus Trypanosoma. As a defense barrier against the host immune response, the entire surface of the bloodstream form of trypanosome is covered with densely packed molecules of VSG that determines the antigenic phenotype of the parasite. Variant surface glycoprotein has a C-terminal domain that is highly conserved in various species of trypanosomes