Binarization of Synchronous Context Free Grammars (SCFG) is essential for achieving polynomial time complexity of decoding for SCFG parsing based machine translation systems. In t...
Tong Xiao, Mu Li, Dongdong Zhang, Jingbo Zhu, Ming...
This paper compares several translation representations for a synchronous context-free grammar parse including CFGs/hypergraphs, finite-state automata (FSA), and pushdown automat...
Gonzalo Iglesias, Cyril Allauzen, William Byrne, A...
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...
Abstract. This paper investigates the learnability of Pregroup Grammars, a context-free grammar formalism recently defined in the field of computational linguistics. In a first ...
We introduce and study Recursive Markov Chains (RMCs), which extend ordinary finite state Markov chains with the ability to invoke other Markov chains in a potentially recursive m...