Next: Parser
Up: Robust parsing of word-graphs
Previous: Parsing word-graphs
Grammar
We require that grammatical analysis finds all maximal
projections anywhere in the input word-graph. This implies that the
top category of the grammar should be defined in such a way that it
derives each of these maximal projections. For this reason, the
grammar contains the declaration:
|
(27) |
Furthermore, there are unary rules rewriting this start category into
each of the relevant maximal projections. One such rule is:
|
(28) |
Similar rules are defined for pp, sbar, root, advp, etc.
2000-07-10