Contextual Binary Feature Grammars were recently proposed by (Clark et al., 2008) as a learnable representation for richly structured context-free and con-text sensitive languages. In this pa-per we examine the representational power of the formalism, its relationship to other standard formalisms and lan-guage classes, and its appropriateness for modelling natural language.
Context-free grammars cannot be identified in the limit from positive examples (Gold 1967), yet natu...
There is currently considerable interest among computational linguists in grammatical formalisms wit...
AbstractThough the field of natural language processing is one of the major aims that has led to the...
Editor: editor We present a polynomial update time algorithm for the inductive inference of a large ...
A binary grammar is a relational grammar with two nonterminal alphabets, two terminal alphabets, a s...
International audienceWe present a polynomial update time algorithm for the inductive inference of a...
The paper discusses some classes of contextual grammars--mainly those with "maximal use of ...
This thesis involves the study of formal properties of grammatical formalisms that are relevant to c...
Investigations of classes of grammars that are nontransformational and at the same time highly const...
Investigations of classes of grammars that are nontransformational and at the same time highly const...
AbstractA new generalization of context-free grammars is introduced: Boolean grammars allow the use ...
Every language, whether it is natural or artificial, has its recognizable grammar that consists of a...
textabstractThis paper classifies a family of grammar formalisms that extend context-free grammar by...
This paper classifies a family of grammar formalisms that extend context-free grammar by talking abo...
We investigate models for learning the class of context-free and context-sensitive languages (CFLs a...
Context-free grammars cannot be identified in the limit from positive examples (Gold 1967), yet natu...
There is currently considerable interest among computational linguists in grammatical formalisms wit...
AbstractThough the field of natural language processing is one of the major aims that has led to the...
Editor: editor We present a polynomial update time algorithm for the inductive inference of a large ...
A binary grammar is a relational grammar with two nonterminal alphabets, two terminal alphabets, a s...
International audienceWe present a polynomial update time algorithm for the inductive inference of a...
The paper discusses some classes of contextual grammars--mainly those with "maximal use of ...
This thesis involves the study of formal properties of grammatical formalisms that are relevant to c...
Investigations of classes of grammars that are nontransformational and at the same time highly const...
Investigations of classes of grammars that are nontransformational and at the same time highly const...
AbstractA new generalization of context-free grammars is introduced: Boolean grammars allow the use ...
Every language, whether it is natural or artificial, has its recognizable grammar that consists of a...
textabstractThis paper classifies a family of grammar formalisms that extend context-free grammar by...
This paper classifies a family of grammar formalisms that extend context-free grammar by talking abo...
We investigate models for learning the class of context-free and context-sensitive languages (CFLs a...
Context-free grammars cannot be identified in the limit from positive examples (Gold 1967), yet natu...
There is currently considerable interest among computational linguists in grammatical formalisms wit...
AbstractThough the field of natural language processing is one of the major aims that has led to the...