102 search results - page 4 / 21 » Tile Rewriting Grammars |
ACL
1992
13 years 8 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...
COLING
2000
13 years 8 months ago
2000
We propose an algorithm for the trausfer of packed linguistic structures, that is, finite collections of labelled graphs which share certain subparts. A labelled graph is seen as ...
ECAL
2001
Springer
13 years 11 months ago
2001
Springer
LACL
2001
Springer
13 years 11 months ago
2001
Springer
COGSCI
2004
13 years 6 months ago
2004
Four different kinds of grammars that can define crossing dependencies in human language are compared here: (i) context sensitive rewrite grammars with rules that depend on contex...