On the acquisition of statives in child russian

It has been previously reported that in languages demonstrating the Root Infinitive (RI) Stage the use of RIs is characterized by two properties: these forms are overwhelmingly eventive and have, in the majority of instances, a modal interpretation. Hoekstra and Hyams (1998, 1999) have proposed a theory stating that these two properties of RIs are co-dependent in that the application of the modal reference restriction limits the use of the aspectual verbal classes to eventive predicates. Furthermore, this theory assumed that the described mutual dependency of these constraints was valid cross-linguistically. In this paper, we investigate the application of this theory to the case of RIs in Russian, one of the languages exhibiting the RI Stage. Using new longitudinal data from two monolingual Russian-speaking children, we demonstrate that the predictions of Hoekstra and Hyams’ approach are not realized for Russian child speech. While the constraint requiring that Ris have a modal reference does not seem to apply in Russian since the infinitival forms do receive past and present tense interpretation, these predicates are still overwhelmingly eventive and stative predicates appear mostly as finite verbs. Having shown that a theory connecting the application of the two restrictions on RIs does not account for the Russian data, we examine several alternative analyses of Russian RIs. We arrive at a conclusion that an explanation based on the lack of the event variable in stative predicates (Kratzer 1989) necessary for the interpretation of RIs in discourse (Avrutin 1997) succeeds in handling the Russian data presented in this article

Merlin: A Language for Provisioning Network Resources

This paper presents Merlin, a new framework for managing resources in software-defined networks. With Merlin, administrators express high-level policies using programs in a declarative language. The language includes logical predicates to identify sets of packets, regular expressions to encode forwarding paths, and arithmetic formulas to specify bandwidth constraints. The Merlin compiler uses a combination of advanced techniques to translate these policies into code that can be executed on network elements including a constraint solver that allocates bandwidth using parameterizable heuristics. To facilitate dynamic adaptation, Merlin provides mechanisms for delegating control of sub-policies and for verifying that modifications made to sub-policies do not violate global constraints. Experiments demonstrate the expressiveness and scalability of Merlin on real-world topologies and applications. Overall, Merlin simplifies network administration by providing high-level abstractions for specifying network policies and scalable infrastructure for enforcing them

Languages of Dot-depth One over Infinite Words

Over finite words, languages of dot-depth one are expressively complete for alternation-free first-order logic. This fragment is also known as the Boolean closure of existential first-order logic. Here, the atomic formulas comprise order, successor, minimum, and maximum predicates. Knast (1983) has shown that it is decidable whether a language has dot-depth one. We extend Knast's result to infinite words. In particular, we describe the class of languages definable in alternation-free first-order logic over infinite words, and we give an effective characterization of this fragment. This characterization has two components. The first component is identical to Knast's algebraic property for finite words and the second component is a topological property, namely being a Boolean combination of Cantor sets. As an intermediate step we consider finite and infinite words simultaneously. We then obtain the results for infinite words as well as for finite words as special cases. In particular, we give a new proof of Knast's Theorem on languages of dot-depth one over finite words.Comment: Presented at LICS 201

DETERMINING LANGUAGE TYPOLOGY BASED ON DIRECTED MOTION LEXICALIZATION PATTERNS AS A LANGUAGE DOCUMENTATION: A CASE STUDY ON JAVANESE

Every language has directed motion constructions, but the lexicalization pattern of the constructions may differ from one language to another. The similarities and differences of directed motion lexicalization patterns can be used as the basis for classifying languages typologically. This paper aims to discuss how language typology can be determined based on directed motion lexicalization patterns found in a language. In this study I use the data of Javanese to examine whether Javanese can be classified into Talmy’s (1975, 1985) typology of verb-framed or satellite framed languages. Some problems and implications of this language typology will be discussed to see whether there is interaction between directed motion lexicalization patterns and other syntactic structures. The data of Javanese show that Javanese has some verb framing and satellite framing characteristics, and so language typology is not exactly definite in the sense that there are some restrictions that need to be considered

Natural language understanding: instructions for (Present and Future) use

In this paper I look at Natural Language Understanding, an area of Natural Language Processing aimed at making sense of text, through the lens of a visionary future: what do we expect a machine should be able to understand? and what are the key dimensions that require the attention of researchers to make this dream come true