Even though progress in theoretical linguistics does not necessarily rely on the construction of working programs, a large proportion of current research in syntactic theory is facilitated by suitable computational tools. However, when natural language processing applications seek to draw on the results from new developments in theories of grammar, not only the nature of the tools has to change...

An exemplar-based computational framework is presented which is compatible with Cognitive Grammar. In an exemplar-based approach, language acquisition is modeled as the incremental, data-oriented storage of experiential patterns, and language performance as the extrapolation of information from those stored patterns on the basis of a language-independent information-theoretic similarity metric....

Communication is fundamental to the evolution and development of all kinds of living beings. With no disputes, languages should be recognized as the most amazing artifacts ever developed by mankind to enable communication. Computer has also become such a unique machine, due to its capacity to communicate with humans through languages. It is worth mentioning that the languages understood by comp...

After Chomsky's (1981) introduction of the Government and Binding (GB) theory of grammar, a research area called GB parsing developed in the mid-eighties to explore parsing architectures based on that framework. In this area, parsing is viewed as the characterization of a mental process rather than a crude mapping from strings to syntactic structures. Therefore in GB parsing there is a need to ...

The present study investigated comparatively the impact of two types of input enhancement (i.e. textual vs. compound enhancement) on developing grammar ability in Iranian EFL setting. Sixty-five female secondary high school students were selected as a homogenous sample out of about a 100-member population based on Nelson language proficiency test. Then, their grammar ability was measured based ...

Constraint Handling Rules (CHR) have provided a realistic solution to an over-arching problem in many elds that deal with constraint logic programming: how to combine recursive functions or relations with constraints while avoiding non-termination problems. This paper focuses on some other bene ts that CHR, speci cally their implementation in SICStus Prolog, have provided to computational lingu...

In this paper we propose a novel computational model for constraint logic programming (CLP) languages. The model provides an eecient mechanism for executing CLP programs by exploiting constraint satisfaction as a means for both solving constraints and controlling the whole computation. In the model, we separate constraint solving from the deduction procedure. Deductions over constraints are ext...

This paper reports on the design and implementation of a morphological analyzer for Wolof. The main motivation for this work is to obtain a linguistically motivated tool using finite-state techniques. The finite-state technology is especially attractive in dealing with human language morphologies. Finite-state transducers (FST) are fast, efficient and can be fully reversible, enabling users to ...

Asking creative questions is a hallmark of human cognition. In comparison, machine learning systems that attempt to mimic this ability are still extremely limited (e.g., current chatbots ask questions based on preprogrammed routines). In the present work, we developed a computational model of question generation. Based on a corpus of questions collected from online participants playing an infor...

This paper proposes a hierarchical organization of the linguistic knowledge, that views grammar as an abstraction of item-dependent information (in particular, an abstraction of subcategorization frames into a hierarchy of classes). The formalism has been successfully applied to a classiication of 105 Italian verbal frames, developed by analysing a corpus of about 500,000 words. The proposed fr...