J05-2002 latter also has implications for linear context-free rewriting systems ( Seki et al. 1991 )
D15-1214 was applied to both L-PCFGs and linear context-free rewriting systems . Their application was
E09-1055 introducing dependency trees and Linear Context-Free Rewriting Systems ( LCFRS ) . Throughout
J11-1008 parsing algorithms for general Linear Context-Free Rewriting Sys - tems . We show that any
E09-1055 dependency parsing to parsing with Linear Context-Free Rewriting Systems ( LCFRS ) , by presenting
E12-1047 discontinuous constituents using Linear Context-Free Rewriting systems ( LCFRS ) has been limited
J13-1003 parsing model based on Probabilistic Linear Context-Free Rewriting Systems ( PLCFRS ) , which implements
J05-2003 and Niv ( 1992 ) argue that even linear context-free rewriting systems ( LCFRSs ) ( Weir 1988
J05-2003 are even weakly equivalent to linear context-free rewriting systems ( Weir 1988 ) . As a
J11-3004 Specifically , Kuhlmann shows that linear context-free rewriting systems -LSB- i , -RSB- ( h1
E09-1055 8 } , respectively . 2.2 LCFRS Linear Context-Free Rewriting Systems ( LCFRS ) have been introduced
J08-1002 considered as the derivation forests of linear context-free rewriting systems ( LCFRSs ) ( Vijay-Shanker
D15-1178 formalisms , Context-Free Grammars and Linear Context-Free Rewriting Systems , our models create desirable
J12-3003 Another form of binarization for linear context-free rewriting systems is restriction of the
E12-1047 <title> Efficient Parsing with Linear Context-Free Rewriting Systems </title> Andreas van
D11-1112 grammars , and more generally to the linear context-free rewriting systems of Vijay-Shanker et al.
D15-1178 yield strings . 3.2 Probabilistic Linear Context-Free Rewriting Systems LCFRS grammars ( Vijay-Shanker
J12-3008 a subset of those produced by linear context-free rewriting systems ( LCFRSs ) ( Vijay-Shankar
J13-1006 deductive CYK parser for Probabilistic Linear Context-Free Rewriting Systems ( PLCFRS ) , showing
J05-2003 that can not even be generated by linear context-free rewriting systems ( see Becker , Rambow
hide detail