Showing 1998Show all
3 papers · 1 filter
cs.CL1998
Restrictions on Tree Adjoining Languages
Giorgio Satta, William Schuler
Several methods are known for parsing languages generated by Tree Adjoining Grammars (TAGs) in O(n^6) worst case running time. In this paper we investigate which restrictions on TA…
cs.CL1998
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…
cmp-lg1998
A Variant of Earley Parsing
Mark-Jan Nederhof, Giorgio Satta
The Earley algorithm is a widely used parsing method in natural language processing applications. We introduce a variant of Earley parsing that is based on a ``delayed'' recognitio…