This paperaddresses the problem of SAT solver performance in IC3, one of the major recent breakthroughs in Model Checking algorithms. Unlike other Bounded and Unbounded Model Checking algorithms, IC3 is characterized by numerous SAT solver queries on small sets of problem clauses. Besides algorithmic issues, the above scenario poses serious performance challenges for SAT solver configuration an...

Contrastively focused constituents in Malagasy, a verb-initial language, occur at the left edge of the clause, separated from the remainder of the clause by the particle no (previous work has shown that no forms a constituent with what follows it, here called the NO-PHRASE). The Malagasy focus construction is usually analyzed as a pseudo-cleft: the focus phrase constitutes the main predicate of...

The paper describes a rule-based system for tagging clause boundaries, implemented for annotating the Estonian Reference Corpus of the University of Tartu, a collection of written texts containing ca 245 million running words and available for querying via Keeleveeb language portal. The system needs information about parts of speech and grammatical categories coded in the word-forms, i.e. it ta...

This paper describes a method for the automatic alignment of parallel texts at clause level. The method features statistical techniques coupled with shallow linguistic processing. It presupposes a parallel bilingual corpus and identifies alignments between the clauses of the source and target language sides of the corpus. Parallel texts are first statistically aligned at sentence level and then...

A number of different formal analyses of relative clauses have been proposed over the years. For example, the adjunction analysis states that the relative clause is adjoined to the modified noun; the antisymmetry analysis (formulated in Kayne 1994) posits that the complementizer phrase (CP) is the direct complement of the determiner (the determiner being the head of the nominal projection), and...

We present the first example of a natural distribution on instances of an NP-complete problem, with the following properties. With high probability a random formula from this distribution (a) is unsatisfiable, (b) has a short proof that can be found easily, and (c) does not have a short (general) resolution proof. This happens already for a very low clause/variable density ratio of = logn (n is...

Case systems abound in natural language processing. Almost any attempt to recognize and uniformly represent relationships within a clause – a unit at the centre of any linguistic system that goes beyond word level statistics – must be based on semantic roles drawn from a small, closed set. The set of roles describing relationships between a verb and its arguments within a clause is a case syste...

Abstract The current study presents an analysis of a linguistic device supporting interactional coherence in computer-mediated communication (CMC). focused on the use German causative conjunction weil and, more specifically, syntactic variation verb-final versus verb-second word order -clause. Verb-final indicates dependent clause, whereas independent clause. While only former is accepted writt...

We investigate geometrical properties of the random K-satisfiability problem using the notion of x-satisfiability: a formula is x-satisfiable is there exist two SAT assignments differing in Nx variables. We show the existence of a sharp threshold for this property as a function of the clause density. For large enough K, we prove that there exists a region of clause density, below the satisfiabi...

This paper describes the first robust approach to automatically labeling clauses with their situation entity type (Smith, 2003), capturing aspectual phenomena at the clause level which are relevant for interpreting both semantics at the clause level and discourse structure. Previous work on this task used a small data set from a limited domain, and relied mainly on words as features, an approac...