Abstract. In this paper we describe an e cient and scalable implementation for grammar induction based on the EMILE approach ( 2], 3], 4], 5], 6]). The current EMILE 4.1 implementa...
Pieter W. Adriaans, Marten Trautwein, Marco Vervoo...
This paper reports a pilot study, in which Constraint Grammar inspiredruleswere learnt using the Progol machine-learning system. Rules discarding faulty readings of ambiguously ta...
Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to dis...
Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
We discuss the advantages of lexicalized tree-adjoining grammar as an alternative to lexicalized PCFG for statistical parsing, describingthe induction of a probabilistic LTAG mode...
Unsupervised grammar induction is one of the most difficult works of language processing. Its goal is to extract a grammar representing the language structure using texts without a...