Contextfree derivation
Publications (5)

1Probabilistic TreeAdjoining Grammar As A Framework For Statistical Natural Language Processing1992  Philip ResnikN) we like Mary (r7 = N ~ Mary) Figure 2: A contextfree derivation mars. \[Jelinek et al., 1990\] characterize a ...

2Constraining Tree Adjoining Grammars by Unification1990  Karin HarbuschIntuitively, the set of initial trees can be seen as contextfree derivation trees. This means, the start symbol is the root...

3RTG based surface realisation for TAGis that efficiency might be increased because the context free derivation trees (i) are simpler than the mildly context sensitive...

4Joint Parsing and Translationrules that it contains. That is, if a tree pi is a contextfree derivation that involves K rules of the form αk → βk , its ...

5SemanticsBased Machine Translation with Hyperedge Replacement Grammarsstrategy for rule extraction: They induce a single contextfree derivation for each graph in the training data, and then extract...