Функционална реченична перспектива у словенским језицима и енглеском

У овом се раду указује на неке особености разматрања функционалне реченичне перспективе које ову појаву повезују с описом језичког система чије је полазиште у уверењу да овај функционише као укупност сређених нивоа испољавања — почев од семантичке базе, преко површинске структуре, па све до разина свог морфемског и фонемског отелотворења. Први део рада (ознака 1) посвећен је краткој карактеризацији феномена на које се примењује назив функционална реченична перспектива, у другом (ознака 2) се расправља о могућностима идентификације ових у исказима садржаним у једној кохерентно организованој целини, у трећем (ознака 3) се ови феномени оцењују с типолошке тачке гледишта, док им се у четвртом (ознака 4) приступа у светлости контрастивне анализе словенских језика, уз давање пропратних опаски о законитостима структурирања текстуалних целина

On Heads and Coordination in Valence Acquisition

Abstract. The aim of this paper is to present the design of a partial syntactic annotation of the IPI PAN Corpus of Polish [22] and the cor-responding extension of the corpus search engine Poliqarp [25,12] devel-oped at the Institue of Computer Science PAS and currently employed in Polish and Portuguese corpora projects. In particular, we will argue for the need to distinguish between, and represent both, syntactic and se-mantic heads, and we will sketch the representation of coordination, the area traditionally controversial both in theoretical and in computational linguistics. The annotation is designed in a way intended to maximise the usefulness of the resulting corpus for the task of automatic valence acquisition

Basic notions of information structure

This article takes stock of the basic notions of Information Structure (IS). It first provides a general characterization of IS — following Chafe (1976) — within a communicative model of Common Ground(CG), which distinguishes between CG content and CG management. IS is concerned with those features of language that concern the local CG. Second, this paper defines and discusses the notions of Focus (as indicating alternatives) and its various uses, Givenness (as indicating that a denotation is already present in the CG), and Topic (as specifying what a statement is about). It also proposes a new notion, Delimitation, which comprises contrastive topics and frame setters, and indicates that the current conversational move does not entirely satisfy the local communicative needs. It also points out that rhetorical structuring partly belongs to IS.Peer Reviewe

The Prague Dependency Treebank: Crossing the Sentence Boundary

Abstract. The units processed by tagging procedures- both automatic and manual- are sentences (as occurring in the texts in the corpus), but the human annotators are instructed to assign (disambiguated) structures according to the meaning of the sentence in its environment, taking contextual (and factual) information into account. We focus in the paper on two issues: how to capture (i) the topic-focus articulation as one of the fundamental properties of sentence structure, which is related to the use of the sentence in a broader context, be it a suprasentential or a situational one, and (ii) the coreferential links in the text.

DNF tautologies with a limited number of occurrences of every variable

It is known that every DNF tautology with all monomials of length k contains a variable with at least \Omega\Gamma 2 k =k) occurrences. It is not known, however, if this bound is tight, i.e. if there are tautologies with at most O(2 k =k) occurrences of every variable. DNF tautologies with 2 k monomials of length k and with at most 2 k =k ff occurrences of every variable, where ff = log 3 4 \Gamma 1 0:26 are presented. This has the following consequence. Let (k; s)-SAT be k-SAT restricted to instances with at most s occurrences of every variable. It is known that for every k, there is an s k such that (k; s k )-SAT is NPcomplete and (k; s k \Gamma 1)-SAT is trivial in the sense that every instance has positive answer. The above result implies that s k 2 k =k ff . This improves the previously known bound s k 11 32 2 k . 1 Introduction Let a (k; s)-formula be a formula in conjunctive normal form whose clauses consist of exactly k literals and such that every variabl..

Dealing with Function Words in Unsupervised Dependency Parsing

In this paper, we show some properties of function words in dependency trees. Function words are grammatical words, such as articles, prepositions, pronouns, conjunctions, or auxiliary verbs. These words are often short and very frequent in texts and therefore many of them can be easily recognized. We formulate a hypothesis that function words tend to have a fixed number of dependents and we prove this hypothesis on treebanks. Using this hypothesis, we are able to improve unsupervised dependency parsing and outperform previously published state-of-the-art results for many languages