Constraint Dependency Grammar (CDG) is a constraint-based grammatical formalism which has a weak generative capacity beyond context-free grammars and supports a very exible parsing algorithm for working with feature grammars; however, the running time of the parser is O(n 4). Hence, we have investigated how to improve the running time of the parser by applying feature constraints diierentially ...

I . First, I would like to say why I do care E.~mmmr formalisms. The point is not only t h a % I was %ra.ined a s a student of linguist-i c s and %hat I always ha.re been interested in theor~l Lcal ling'uJ, stics, but in the present context a.]SO ) and main].~ ~ that natu:e&:[ ].angu a g e processing systems mostly a~'e too complex to be bui].t, modified, comp].emented, enriched.,., o , without...

This note discusses the current development of an approach to parsing designed to overcome some of the problems of existing parsers, particularly with respect to their utility as probabilistic language models. The parser combines lexical and grammatical constraints into a uniform grammatical representation and is readily trainable (since the parser output is indistinguishable from the grammar i...

A strong inductive bias is essential in unsupervised grammar induction. We explore a particular sparsity bias in dependency grammars that encourages a small number of unique dependency types. Specifically, we investigate sparsity-inducing penalties on the posterior distributions of parent-child POS tag pairs in the posterior regularization (PR) framework of Graça et al. (2007). In experiments w...

Constraint Dependency Grammar CDG is a constraint based grammatical formalism that has a weak generative capacity beyond context free gram mars and supports a very exible parsing algorithm for working with feature grammars however the running time of the parser is O n Hence we have investi gated how to improve the running time of the parser by applying feature constraints di erentially and by u...

The programming language PROLOG has proved to be an excellent tool for implementing natural language processing systems. Its built-in resolution and unification mechanisms are well suited to both accept and generate sentences of artificial and natural languages. Although supporting many different linguistic formalisms, its straightforwardness and elegance have perhaps best been demonstrated wit...

Grammar formalisms built on the notion of word-to-word dependencies make attractive alternatives to formalisms built on phrase structure representations. However, little is known about the formal properties of dependency grammars, and few such grammars have been implemented. We present results from two strands of research that address these issues. The aims of this research were to classify dep...

This paper presents the IULA Spanish LSP Treebank, a dependency treebank of over 41,000 sentences of different domains (Law, Economy, Computing Science, Environment, and Medicine), developed in the framework of the European project METANET4U. Dependency annotations in the treebank were automatically derived from manually selected parses produced by an HPSG-grammar by a deterministic conversion ...