In this work, we prove that metric spaces with uniform normal structure have a kind of intersection property, which is equivalent to reflexivity in Banach spaces.

This paper presents the conversion of SynTagRus dependency structures into Penn Treebank style phrase structures, whose resulting data will be used to train a statistical constituency parser for Russian and create a large-scale constituency-parsed corpus. The implemented conversion includes various innovative features in order to create phrase structure trees that are closest to Penn Treebank s...

Let R be a regular ring essentially of finite type over a perfect field k. An R–module M is called a unit R[F ]–module if it comes equipped with an isomorphism F M −→ M where F denotes the Frobenius map on SpecR, and F e∗ is the associated pullback functor. It is well known that M then carries a natural DR–module structure. In this paper we investigate the relation between the unit R[F ]–struct...

This paper investigates the seminal texts on Immediate Constituent Analysis and the associated diagrams. We show that the relations between the whole and its parts, that are typical of current phrase structure trees, were less prominent in the early diagramming efforts than the relationships between units of the same level. This can be observed until the beginning of the 1960’s, including in Ch...

This chapter analyses the relationships between the structure of data gathered from a recorded of an interactive situation and the temporal patterns (T-patterns) obtained through use of the THEME software. Various simulated interactive situations are presented, along with hypothetical data that invite reflection; an initial micro-analytic study that enables the structure of the Tpatterns to be ...

In classifier combining, one tries to fuse the information that is given by a set of base classifiers. In such a process, one of the difficulties is how to deal with the variability between classifiers. Although various measures and many combining rules have been suggested in the past, the problem of constructing optimal combiners is still heavily studied. In this paper, we discuss and illustra...

Let F be a life distribution with survival function F = 1 F and 00 — finite mean y * j n F(x)dx. The scaled total time on test transform -1 F ( t ) — <P,,(t) = /n /F(x)dx/y was introduced by Barlow and Campo (1975) as a r U tool in the statistical analysis of life data. The properties IFR, IFRA, NBUE, DMRL and heavy-tailedness can be translated to properties of tp„(t). r We discuss the previous...

This paper presents the Arborator, an online tool for collaborative dependency annotation together with a case study of crowdsourcing in a pedagogical university context. In greater detail, we explore what generally distinguishes dependency annotation tools from phrase structure annotation tools and we introduce existing tools for dependency annotation as well as the distinctive features and de...