11 search results - page 1 / 3 » Transforming Linear Context-Free Rewriting Systems into Mini... |
LACL
2001
Springer
13 years 9 months ago
2001
Springer
NAACL
2010
13 years 3 months ago
2010
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
NAACL
2010
13 years 3 months ago
2010
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
ACL
1992
13 years 6 months ago
1992
We show that the class of string languages generated by linear context-free rewriting systems is equal to the class of output languages of deterministic treewalking transducers. F...
ACL
1992
13 years 6 months ago
1992
The class of linear context-free rewriting systems has been introduced as a generalization of a class of grammar formalisms known as mildly context-sensitive. The recognition prob...