26 citations · 68 across the 13 of their papers we have counts for
4 papers · 1 filter
Incremental Parser Generation for Tree Adjoining Grammars
Anoop Sarkar
This paper describes the incremental generation of parse tables for the LR-type parsing of Tree Adjoining Languages (TALs). The algorithm presented handles modifications to the inp…
Separating Dependency from Constituency in a Tree Rewriting System
Anoop Sarkar
In this paper we present a new tree-rewriting formalism called Link-Sharing Tree Adjoining Grammar (LSTAG) which is a variant of synchronous TAGs. Using LSTAG we define an approach…
Conditions on Consistency of Probabilistic Tree Adjoining Grammars
Anoop Sarkar
Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting…
Prefix Probabilities from Stochastic Tree Adjoining Grammars
Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta
Language models for speech recognition typically use a probability model of the form Pr(a_n | a_1, a_2, ..., a_{n-1}). Stochastic grammars, on the other hand, are typically used to…