Range concatenation grammar (RCG) is a grammar formalism developed by Pierre Boullier [1] in 1998 as an attempt to characterize a number of phenomena of natural language, such as Chinese numbers and German word order scrambling, which are outside the bounds of the mildly context-sensitive languages.[2]
From a theoretical point of view, any language that can be parsed in polynomial time belongs to the subset of RCG called positive range concatenation grammars, and reciprocally.[4]
Though intended as a variant on Groenink's literal movement grammars (LMGs), RCGs treat the grammatical process more as a proof than as a production. Whereas LMGs produce a terminal string from a start predicate, RCGs aim to reduce a start predicate (which predicates of a terminal string) to the empty string, which constitutes a proof of the terminal strings membership in the language.
^Boullier, Pierre (Jan 1998). Proposal for a Natural Language Processing Syntactic Backbone(PDF) (Technical report). Vol. 3342. INRIA Rocquencourt (France).
^Pierre Boullier (1999). "Chinese Numbers, MIX, Scrambling, and Range Concatenation Grammars" (PDF). Proc. EACL. pp. 53–60. Archived from the original (PDF) on 2003-05-15.
^Eberhard Bertsch and Mark-Jan Nederhof (Oct 2001). "On the complexity of some extensions of RCG parsing" (PDF). Proceedings of the Seventh International Workshop on Parsing Technologies (Beijing). pp. 66–77.
^Laura Kallmeyer (2010). Parsing Beyond Context-Free Grammars. Springer Science & Business Media. p. 37. ISBN 978-3-642-14846-0. citing Bertsch, Nederhof (2001)[3]
and 20 Related for: Range concatenation grammar information
Rangeconcatenationgrammar (RCG) is a grammar formalism developed by Pierre Boullier in 1998 as an attempt to characterize a number of phenomena of natural...
in Saltillo, Mexico, branded as RCG Televisión RangeConcatenationGrammar, a type of formal grammar Restored Church of God Revolutionary Communist Group...
In formal language theory, an LL grammar is a context-free grammar that can be parsed by an LL parser, which parses the input from Left to right, and...
0, the empty word, which is often denoted by e, ε, λ or even Λ. By concatenation one can combine two words to form a new word, whose length is the sum...
literals and using string concatenation: 'I said, "This is ' + "John's" + ' apple."' Python has string literal concatenation, so consecutive string literals...
In computer science, a grammar is informally called a recursive grammar if it contains production rules that are recursive, meaning that expanding a non-terminal...
string concatenation, this formalism is Turing complete; hence, even the most basic questions about the language described by an arbitrary 2VW grammar are...
under the operation of concatenation. By treating Σ ∗ {\displaystyle \Sigma ^{*}} as an algebraic monoid under concatenation we see that the monoid structure...
noncontracting grammars do not occur. Chomsky (1963) calls a noncontracting grammar a "type 1 grammar", and a context-sensitive grammar a "type 2 grammar", and...
"powerful", by dropping the final s of omnis and concatenating. Often, the concatenation changed the part of speech, and nouns were produced from verb segments...
language theory, a regular tree grammar is a formal grammar that describes a set of directed trees, or terms. A regular word grammar can be seen as a special...
Head grammar (HG) is a grammar formalism introduced in Carl Pollard (1984) as an extension of the context-free grammar class of grammars. Head grammar is...
"12014" (concatenation of strings) or something else? D disallows + operator for arrays (and strings), and provides separate operator for concatenation (similarly...
the following operations. Union Intersection: 59–60 (see picture) Concatenation Complement Kleene closure Reversal Quotient[citation needed] Substitution[citation...
vowel sequence. Incorporated roots have been replaced by a system of concatenation. Formatives and personal reference categories now have the option to...
numeric value or a concatenation of numeric values separated by .. Metasymbol - is placed between two numeric values to denote value range. As that of BNF...
; Shamir, E. (1961), "On formal properties of simple phrase structure grammars", Zeitschrift für Phonetik, Sprachwissenschaft und Kommunikationsforschung...
In formal language theory, a noncontracting grammar is in Kuroda normal form if all production rules are of the form: AB → CD or A → BC or A → B or A...
digraphs, but there are a few exceptions: tizennyolc ("eighteen") is a concatenation of tizen + nyolc. Hungarian has minimal pairs of single vs. double consonants...
following operations over them are defined to produce regular expressions: (concatenation) (RS) denotes the set of strings that can be obtained by concatenating...