Identification of the certainty of events is an important text mining problem. In particular, biomedical texts report medical conditions or findings that might be factual, hedged or negated. Identification of negation and its scope over a term of interest determines whether a finding is reported and is a challenging task. Not much work has been performed for Spanish in

The problem of finding regularity conditions for languages is, via the syntactic monoid, closely related to the classical Burnside problem. This survey paper presents several results and conjectures in this direction as well as on related subjects, including bounded languages, pumping, square-free words, commutativity, and rational power series.

A growing body of research into the expressive power of logics on trees has employed algebraic methods—especially the syntactic forest algebra, a generalization of the syntactic monoid of regular languages. Here we enlarge the mathematical foundations of this study by extending Tilson’s theory of the algebra of finite categories, and in particular, the Derived Category Theorem, to the setting o...

Given a class C of word languages, the C-separation problem asks for an algorithm that, given as input two regular languages, decides whether there exists a third language in C containing the rst language, while being disjoint from the second. Separation is usually investigated as a means to obtain a deep understanding of the class C. In the paper, we are mainly interested in classes de ned by ...

We investigate the question how manually created syntactic annotations can be used to analyse and improve consistency in manually created temporal annotations. Our work introduces an annotation project for Estonian, where temporal annotations in TimeML framework were manually added to a corpus containing gold standard morphological and dependency syntactic annotations. In the first part of our ...

— It is shown that one can décide whether a langage has dot-depth one in the dot-depth hierarchy introduced by BrzozowskL The décision procedure is based on an algebraic characterization of the syntactic semigroup of a langage of dot-depth 0 or 1. Résumé. — On démontre que Von peut décider si un langage est de hauteur 1 dans la hiérarchie de concaténation introduite par BrzozowskL L'algorithme ...

We consider the languages of finite trees called tree-shift languages which are factorial extensible tree languages. These languages are sets of factors of subshifts of infinite trees. We give effective syntactic characterizations of two classes of regular tree-shift languages: the finite type tree languages and the tree languages which are almost of finite type. Each class corresponds to a cla...

This longitudinal study investigated the impact of different Frequency Patterns (FP) on the syntactic production of a six-year-old EFL learner in a home context. Target syntactic constructions were presented using games and plays and were traced for their occurrence patterns in input and output. Following each instruction period, the constructions were measured through immediate and delayed ora...

recent research in the area of second language acquisition has proposed that bilinguals and l2 learners show syntactic indeterminacy when syntactic properties interface with other cognitive domains. most of the research in this area has focused on the pragmatic use of syntactic properties while the investigation of compliance with a grammatical rule at syntax-related interfaces has not received...