| J05-2002 | also has implications for linear | context-free rewriting systems | ( Seki et al. 1991 ) . The construction |
| J13-2004 | grammar in the framework of linear | context-free rewriting systems | . A characteristic property of |
| D15-1214 | applied to both L-PCFGs and linear | context-free rewriting systems | . Their application was the analysis |
| E09-1055 | introducing dependency trees and Linear | Context-Free Rewriting Systems | ( LCFRS ) . Throughout the paper |
| E12-1047 | Efficient Parsing with Linear | Context-Free Rewriting Systems | </title> Andreas van Abstract |
| D15-1178 | strings . 3.2 Probabilistic Linear | Context-Free Rewriting Systems | LCFRS grammars ( Vijay-Shanker |
| E09-1055 | parsing to parsing with Linear | Context-Free Rewriting Systems | ( LCFRS ) , by presenting a technique |
| E12-1047 | discontinuous constituents using Linear | Context-Free Rewriting systems | ( LCFRS ) has been limited to |
| J13-1003 | based on Probabilistic Linear | Context-Free Rewriting Systems | ( PLCFRS ) , which implements |
| E09-1055 | respectively . 2.2 LCFRS Linear | Context-Free Rewriting Systems | ( LCFRS ) have been introduced |
| J05-2003 | 1992 ) argue that even linear | context-free rewriting systems | ( LCFRSs ) ( Weir 1988 ) are |
| J11-3004 | Specifically , Kuhlmann shows that linear | context-free rewriting systems | -LSB- i , -RSB- ( h1 , ... , |
| J05-2003 | even weakly equivalent to linear | context-free rewriting systems | ( Weir 1988 ) . As a consequence |
| J08-1002 | the derivation forests of linear | context-free rewriting systems | ( LCFRSs ) ( Vijay-Shanker , |
| D15-1178 | Context-Free Grammars and Linear | Context-Free Rewriting Systems | , our models create desirable |
| J12-3003 | form of binarization for linear | context-free rewriting systems | is restriction of the fan-out |
| D11-1112 | and more generally to the linear | context-free rewriting systems | of Vijay-Shanker et al. ( 1987 |
| J13-2004 | dependency grammar based on linear | context-free rewriting systems | ( LCFRSs ) ( Vijay-Shanker , |
| J12-3008 | subset of those produced by linear | context-free rewriting systems | ( LCFRSs ) ( Vijay-Shankar , |
| J13-1006 | parser for Probabilistic Linear | Context-Free Rewriting Systems | ( PLCFRS ) , showing that LCFRS |
