Range concatenation grammars
Semantic Scholar uses AI to extract papers important to this topic.
In this paper we present a parsing framework for extensions of Tree Adjoining Grammars (TAG) called TuLiPA (Tübingen Linguistic… (More)
We present a CYK and an Earley-style algorithm for parsing Range Concatenation Grammar (RCG), using the deductive parsing… (More)
Range Concatenation Grammars (RCGs) are a syntactic formalism which possesses many attractive properties. It is more powerful… (More)
We present an Earley-style parser for simple range concatenation grammar, a formalism strongly equivalent to linear context-free… (More)
Positive and bottom-up non-erasing binary range concatenation grammars (Boullier, 1998) with at most binary predicates ((2,2… (More)
This paper investigates the relation between TT-MCTAG, a formalism used in computational linguistics, and RCG. RCGs are known to… (More)
In this paper we introduce a novel framework to compute jointly syntactic parses and semantic representations of a written… (More)
- Electr. Notes Theor. Comput. Sci.
Though the field of natural language processing is one of the major aims that has led to the definition of contextual grammars… (More)
The notion of mild context-sensitivity was formulated in an at tempt to express the formal power which is both necessary and… (More)