11 search results - page 2 / 3 » Transforming Linear Context-Free Rewriting Systems into Mini... |
ACL
2010
13 years 5 months ago
2010
Linear Context-Free Rewriting Systems (LCFRSs) are a grammar formalism capable of modeling discontinuous phrases. Many parsing applications use LCFRSs where the fan-out (a measure...
COLING
2010
13 years 2 months ago
2010
This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with context-summ...
ACL
2004
13 years 9 months ago
2004
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...
AAAI
2011
12 years 7 months ago
2011
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...
LACL
2005
Springer
14 years 1 months ago
2005
Springer
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...