Search Results for author:
Found 3 papers, 1 papers with code
Efficient Algorithms for Recognizing Weighted Tree-Adjoining Languages
From these, we also immediately obtain stringsum and allsum algorithms for TAG, LIG, PAA, and EPDA.
Convergence and Diversity in the Control Hierarchy
Furthermore, using an even stricter notion of equivalence called d-strong equivalence, we make precise the intuition that a CFG controlling a CFG is a TAG, a PDA controlling a PDA is an embedded PDA, and a PDA controlling a CFG is a LIG.
Algorithms for Weighted Pushdown Automata
Weighted pushdown automata (WPDAs) are at the core of many natural language processing tasks, like syntax-based statistical machine translation and transition-based dependency parsing.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
