Sciweavers

8 search results - page 2 / 2
» Data-Driven Parsing with Probabilistic Linear Context-Free R...
Sort
View
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 23 days ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
ACL
2004
14 years 11 months ago
Generalized Multitext Grammars
Generalized Multitext Grammar (GMTG) is a synchronous grammar formalism that is weakly equivalent to Linear Context-Free Rewriting Systems (LCFRS), but retains much of the notatio...
I. Dan Melamed, Giorgio Satta, Benjamin Wellington
AAAI
2011
13 years 9 months ago
Recognizing Plans with Loops Represented in a Lexicalized Grammar
This paper extends existing plan recognition research to handle plans containing loops. We supply an encoding of plans with loops for recognition, based on techniques used to pars...
Christopher W. Geib, Robert P. Goldman