A regular language L over an alphabet A is called piecewise testable if it is a finite boolean combination of languages of the form Aa1A a2A ∗ . . . Aa`A ∗, where a1, . . . , a` ∈ A, ` ≥ 0. An effective characterization of piecewise testable languages was given in 1972 by Simon who proved that a language L is piecewise testable if and only if its syntactic monoid is J -trivial. Nowadays there e...

e description of the reciprocity phenomenon is more tricky than it is supposed in grammatical handbooks: It must cover both the issues of lexicon and of syntax and of their interplay as well. e lexical counterpart of the English expression each other is not the central (core) means for denoting reciprocity in some Slavonic languages, esp. in Czech. e troublemaking Czech reflexive se/siplays ...

The development of metalinguistic awareness, and specifically syntactic awareness, (here measured by age-related changes in the ability to judge and revise unacceptable sentences), reflects developmental changes in focus from semantic to syntactic properties of sentences. Previous research reported that children find judgements of word-order changes easier than morphological violations (Hakes, ...

The emerging interdisciplinary field of Intelligent Computer Assisted Language Learning (ICALL) aims to integrate the knowledge from computational linguistics into computer-assisted language learning (CALL). REAP.PT is a project emerging from this new field, aiming to teach Portuguese in an innovative and appealing way, and adapted to each student. In this paper, we present a new improvement of...

This paper shows how large-coverage morphological and syntactic NLP lexicons can be developed by interpreting, converting to a common format and merging existing lexical resources. Applied on Spanish, this allowed us to build a morphological and syntactic lexicon, the Leffe. It relies on the Alexina framework, originally developed together with the French lexicon Lefff. We describe how the inpu...

This paper presents the design and development of a system for the detection and correction of syntactic errors in free texts. The system is composed of three main modules: a) a robust syntactic analyser, b) a compiler that will translate error processing rules, and c) a module that coordinates the results of the analyser, applying different combinations of the already compiled error rules. The...