We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...
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...
Since 1995, a few statistical parsing algorithms have demonstrated a breakthrough in parsing accuracy, as measured against the UPenn TREEBANK as a gold standard. In this paper we ...
Scott Miller, Heidi Fox, Lance A. Ramshaw, Ralph M...
This paper will present a generalisation of chart parsing able to cope with the case where the object being parsed is a particular kind of diagram (a flowgraph) and the grammar is...