Abstract This paper sketches a grammar of English relative clause constructions (including infinitival and reduced relatives) based on the notions of construction type and type constraints. Generalizations about dependency relations and clausal functions are factored into distinct dimensions contributing constraints to specific construction types in a multiple inheritance type hierarchy. The gr...

Extraction of relations between entities is an important part of Information Extraction on free text. Previous methods are mostly based on statistical correlation and dependency relations between entities. This paper re-examines the problem at the multiresolution layers of phrase, clause and sentence using dependency and discourse relations. Our multi-resolution framework ARE (Anchor and Relati...

Most relevant computational tasks are not polynomial-size compilable, even though they are compiled rather efficiently in practice. Parameterized compilability offers a framework to narrow this gap between theoretical incompilability and practical compilation by relaxing the size bound posed on compilations. We study various computational problems (related to clause entailment, the classical pr...

MOTIVATION Supervised biomedical relation extraction plays an important role in biomedical natural language processing, endeavoring to obtain the relations between biomedical entities. Drug-drug interactions, which are investigated in the present paper, are notably among the critical biomedical relations. Thus far many methods have been developed with the aim of extracting DDI relations. Howeve...

Pregroup grammars with a possibly infinite number of lexical entries are polynomial if the length of type assignments for sentences is a polynomial in the number of words. Polynomial pregroup grammars are shown to generate the standard mildly context sensitive formal languages as well as some context sensitive natural language fragments of Dutch, SwissGerman or Old Georgian. A polynomial recogn...

Japanese dependency structure is usually represented by relationships between phrasal units called bunsetsus. One of the biggest problems with dependency structure analysis in spontaneous speech is that clause boundaries are ambiguous. This paper describes a method for detecting the boundaries of quotations and inserted clauses and that for improving the dependency accuracy by applying the dete...

We consider the question of the existence of variables with few occurrences in boolean conjunctive normal forms (clause-sets). Let μvd(F ) for a clause-set F denote the minimal variable-degree, the minimum of the number of occurrences of variables. Our main result is an upper bound μvd(F ) ≤ nM(σ(F )) ≤ σ(F ) + 1 + log 2 (σ(F )) for lean clause-sets F in dependency on the surplus σ(F ). Lean cl...

This paper proposes and discusses issues on local and global text structures, all of them being connected to a lexical concept of predication. The main contributions of the present work comprise: (a) A novel functional X-bar (FX-bar) scheme is advised, aiming to reveal, model and relate the local, clause-level markers and text structures. (b) At global level, two FX-bar schemes are proposed, on...

The paper concentrates on deriving non-obvious information about clause structure of complex sentences from the Prague Dependency Treebank. Individual clauses and their mutual relationship are not explicitly annotated in the treebank, therefore it was necessary to develop an automatic method transforming the original annotation concentrating on the syntactic role of individual word forms into a...

This paper tests claims that children with Grammatical(G)-SLI are impaired in hierarchical structural dependencies at the clause level and in whatever underlies such dependencies with respect to movement, chain formation and feature checking; that is, their impairment lies in the syntactic computational system itself (the Computational Grammatical Complexity hypothesis proposed by van der Lely ...