ETH Zürich; University of Notre Dame
algorithms;parsing;semirings;tree adjoining grammars;linear indexed grammars;embedded pushdown automata
Efficient Algorithms for Recognizing Weighted Tree-Adjoining Languages