Contextual Grammars were introduced by Solomon Marcus in 1969 as "intrinsic grammars" without auxiliary symbols, based only on the fundamental linguistic operation of inserting words into given phrases according to certain contextual dependencies. The formal properties of the formalism have been extensively studied. Furthermore, it can be shown that this formalism provides an appropriate description of natural languages. But unfortunately, up to now no parser which runs in polynomial time was known for some linguistically relevant classes of Contextual Grammar. In the following, an intertwined two--level Earley-- based parser is presented for Contextual Grammars with finite, regular or context--free selectors on the basis of the t...
AbstractPattern selector grammars are defined in general. We concentrate on the study of special gra...
Abstract. In this paper we investigate the use of polymorphic categorial grammars as a model for par...
Investigations of classes of grammars that are nontransformational and at the same time highly const...
The paper discusses some classes of contextual grammars--mainly those with "maximal use of ...
AbstractWe consider the following restriction of internal contextual grammars, called local: in any ...
AbstractWe consider the following restriction of internal contextual grammars, called local: in any ...
Parsing is the process of assigning structure to sentences. The structure is obtained from the gramm...
International audienceThis article is a study of an algorithm designed and implemented by Emmanuel R...
Parsers for context-free grammars can be implemented directly and naturally in a functional style kn...
International audienceThis article is a study of an algorithm designed and implemented by Emmanuel R...
International audienceThis article is a study of an algorithm designed and implemented by Emmanuel R...
AbstractThough the field of natural language processing is one of the major aims that has led to the...
AbstractK-depth grammars extend context-free grammars allowingk⩾1 rewriting points for a single non-...
In this paper we present a scheme to extend a recognition algorithm for Context-Free Gram- mars (CFG...
AbstractPattern selector grammars are defined in general. We concentrate on the study of special gra...
AbstractPattern selector grammars are defined in general. We concentrate on the study of special gra...
Abstract. In this paper we investigate the use of polymorphic categorial grammars as a model for par...
Investigations of classes of grammars that are nontransformational and at the same time highly const...
The paper discusses some classes of contextual grammars--mainly those with "maximal use of ...
AbstractWe consider the following restriction of internal contextual grammars, called local: in any ...
AbstractWe consider the following restriction of internal contextual grammars, called local: in any ...
Parsing is the process of assigning structure to sentences. The structure is obtained from the gramm...
International audienceThis article is a study of an algorithm designed and implemented by Emmanuel R...
Parsers for context-free grammars can be implemented directly and naturally in a functional style kn...
International audienceThis article is a study of an algorithm designed and implemented by Emmanuel R...
International audienceThis article is a study of an algorithm designed and implemented by Emmanuel R...
AbstractThough the field of natural language processing is one of the major aims that has led to the...
AbstractK-depth grammars extend context-free grammars allowingk⩾1 rewriting points for a single non-...
In this paper we present a scheme to extend a recognition algorithm for Context-Free Gram- mars (CFG...
AbstractPattern selector grammars are defined in general. We concentrate on the study of special gra...
AbstractPattern selector grammars are defined in general. We concentrate on the study of special gra...
Abstract. In this paper we investigate the use of polymorphic categorial grammars as a model for par...
Investigations of classes of grammars that are nontransformational and at the same time highly const...