Treebanks, such as the Penn Treebank (PTB), offer a simple approach to obtaining a broad coverage grammar: one can simply read the grammar off the parse trees in the treebank. Whi...
Alexander Krotov, Mark Hepple, Robert J. Gaizauska...
We present a phrasal synchronous grammar model of translational equivalence. Unlike previous approaches, we do not resort to heuristics or constraints from a word-alignment model,...
Phil Blunsom, Trevor Cohn, Chris Dyer, Miles Osbor...
We present an algorithm for computing n-gram probabilities from stochastic context-free grammars, a procedure that can alleviate some of the standard problems associated with n-gr...
This paper discusses the derivation of functional programs for grammar analysis problems, such as the Empty problem and the Reachable problem. Grammar analysis problems can be div...
Successful applications of digital libraries require structured access to sources of information. This paper presents an approach to extract the logical structure of text document...