137,443 research outputs found

    Syntactic Computation as Labelled Deduction: WH a case study

    Get PDF
    This paper addresses the question "Why do WH phenomena occur with the particular cluster of properties observed across languages -- long-distance dependencies, WH-in situ, partial movement constructions, reconstruction, crossover etc." These phenomena have been analysed by invoking a number of discrete principles and categories, but have so far resisted a unified treatment. The explanation proposed is set within a model of natural language understanding in context, where the task of understanding is taken to be the incremental building of a structure over which the semantic content is defined. The formal model is a composite of a labelled type-deduction system, a modal tree logic, and a set of rules for describing the process of interpreting the string as a set of transition states. A dynamic concept of syntax results, in which in addition to an output structure associated with each string (analogous to the level of LF), there is in addition an explicit meta-level description of the process whereby this incremental process takes place. This paper argues that WH-related phenomena can be unified by adopting this dynamic perspective. The main focus of the paper is on WH-initial structures, WH in situ structures, partial movement phenomena, and crossover phenomena. In each case, an analysis is proposed which emerges from the general characterisatioan of WH structures without construction-specific stipulation.Articl

    Computability of the causal boundary by using isocausality

    Full text link
    Recently, a new viewpoint on the classical c-boundary in Mathematical Relativity has been developed, the relations of this boundary with the conformal one and other classical boundaries have been analyzed, and its computation in some classes of spacetimes, as the standard stationary ones, has been carried out. In the present paper, we consider the notion of isocausality given by Garc\'ia-Parrado and Senovilla, and introduce a framework to carry out isocausal comparisons with standard stationary spacetimes. As a consequence, the qualitative behavior of the c-boundary (at the three levels: point set, chronology and topology) of a wide class of spacetimes, is obtained.Comment: 44 pages, 5 Figures, latex. Version with minor changes and the inclusion of Figure

    FCFS Parallel Service Systems and Matching Models

    Get PDF
    We consider three parallel service models in which customers of several types are served by several types of servers subject to a bipartite compatibility graph, and the service policy is first come first served. Two of the models have a fixed set of servers. The first is a queueing model in which arriving customers are assigned to the longest idling compatible server if available, or else queue up in a single queue, and servers that become available pick the longest waiting compatible customer, as studied by Adan and Weiss, 2014. The second is a redundancy service model where arriving customers split into copies that queue up at all the compatible servers, and are served in each queue on FCFS basis, and leave the system when the first copy completes service, as studied by Gardner et al., 2016. The third model is a matching queueing model with a random stream of arriving servers. Arriving customers queue in a single queue and arriving servers match with the first compatible customer and leave immediately with the customer, or they leave without a customer. The last model is relevant to organ transplants, to housing assignments, to adoptions and many other situations. We study the relations between these models, and show that they are closely related to the FCFS infinite bipartite matching model, in which two infinite sequences of customers and servers of several types are matched FCFS according to a bipartite compatibility graph, as studied by Adan et al., 2017. We also introduce a directed bipartite matching model in which we embed the queueing systems. This leads to a generalization of Burke's theorem to parallel service systems

    カイワ ダイアログ アンショウ ニ ジュウジ サセル ガイコクゴ シドウホウ ガ スピーキングジ ノ テイケイ ヒョウゲン ノ シヨウ ト アンキ ガクシュウ ニ オヨボス エイキョウ ニ カンスル キソ ケンキュウ

    Get PDF
    PDF/A formatsAccess: via World Wide Web東京外国語大学大学院総合国際学研究科博士 (学術) 論文 (2016年4月)Author's thesis (Ph.D)--Tokyo University of Foreign Studies, 2016博甲第214号Bibliography: p. 183-195Summary in English and Japanese東京外国語大学 (Tokyo University of Foreign Studies)博士 (学術
    corecore