We propose an extension of primal grammars (Hermann & Galbavý 1997). Primal grammars are term grammars with a high expressive power and good computational properties. The extended grammars have exactly the same properties but are more modular, more concise, and easier to use, as shown by some examples. An algorithm transforming any extended primal grammar into an equivalent primal grammar is pr...

Fluid Construction Grammar (FCG) is an open-source computational grammar formalism that is becoming increasingly popular for studying the history and evolution of language. This demonstration shows how FCG can be used to operationalise the cultural processes and cognitive mechanisms that underly language evolution and change.

This paper shows an experimental study about the design of grammars for a voice interface system. The influence of the grammar design on the behavior of the voice recognition system regarding accuracy and computational cost is assessed through tests. With the redesign of a grammar we show that those characteristics can be expressively improved.

Implementation of a new compiler usually requires making frequent adjustments to grammar de nitions. An incremental technique for updating the parser tables after a minor change to the grammar could potentially save much computational e ort. More importantly, debugging a grammar is made easier if the grammar is re-checked for correctness after each small change to the grammar. The basic design ...

We report work on effectively incorporating linguistic knowledge into grammar induction. We use a highly interactive bot tom-up inductive logic programming (ILP) algorithm to learn 'missing' grammar rules from an :incomplete grammar. Using linguistic constraints on, for example, head features and gap threading, reduces the search space to such an extent that, in the small-scale experiments repo...

The framework presented in this chapter assumes that any grammar is a particular first order theory with equality. We will turn our attention to those first order theories admitting complete models and extend them to recursively defined relations. Logic programming is an ideal paradigm for such a framework in that it supports a direct mapping between grammars, seen as first order logic theories...

The framework presented in this chapter assumes that any grammar is a particular first order theory with equality. We will turn our attention to those first order theories admitting complete models and extend them to recursively defined relations. Logic programming is an ideal paradigm for such a framework in that it supports a direct mapping between grammars, seen as first order logic theories...

This paper informally presents a new view of grammar that has emerged from a number of distinct but related lines of investigation in theoretical and computational linguistics. Under this view, many current linguistic theories-including Lexical-Functional Grammar (LFG), Generalized Phraae Structure Grammar (GPSG), Head-Driven Phrase Structure Grammar (HPSG), and categorial grammar (CG)-fall wit...

Writing deep linguistic grammars has been considered a highly specialized skill, requiring the use of tools with steep learning curves and complex installation procedures. As the use of statistical methods has increased, new generations of computational linguists are getting less and less prepared for grammar writing tasks. In an aim to provide a better learning experience for grammar writers, ...