Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
Range Concatenation Grammars
verfasst von : PD Dr. Laura Kallmeyer
Erschienen in: Parsing Beyond Context-Free Grammars
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this chapter, we turn to
Range Concatenation Grammars
(RCGs)
Range Concatenation Grammar
(Boullier, 1998a; Boullier, 1999b; Boullier, 2000b), the most powerful formalism treated in this book.
In the previous chapter, we have already seen
simple
RCG, a syntactic variant of LCFRS. As already mentioned, in a simple RCG, we can understand non-terminals as predicates that are satisfied by all the string tuples that are in their yields. A rewriting rule (
clause
) with left-hand side predicate
A
is then the specification of a sufficient condition for a string tuple to satisfy the predicate
A
.