论文信息 - A Note on Contextual Binary Feature Grammars

A Note on Contextual Binary Feature Grammars

Contextual Binary Feature Grammars were recently proposed by (Clark et al., 2008) as a learnable representation for richly structured context-free and context sensitive languages. In this paper we examine the representational power of the formalism, its relationship to other standard formalisms and language classes, and its appropriateness for modelling natural language.

Amaury Habrard | Alexander Clark | Remi Eyraud

[1] Alexander Okhotin,et al. Conjunctive Grammars , 2001, J. Autom. Lang. Comb..

[2] Amaury Habrard,et al. A Polynomial Algorithm for the Inference of Context Free Languages , 2008, ICGI.

[3] Alexander Clark,et al. Polynomial Identification in the Limit of Substitutable Context-free Languages , 2005 .

[4] Victor Mitrana,et al. Marcus External Contextual Grammars: From One to Many Dimensions , 2005, Fundam. Informaticae.

[5] Pierre Boullier,et al. A Cubic Time Extension of Context-Free Grammars , 2000, Grammars.

[6] Alexander Okhotin. An overview of conjunctive grammars , 2003 .

[7] Pierre Boullier. Counting with range concatenation grammars , 2003, Theor. Comput. Sci..

[8] Takashi Yokomori,et al. Polynomial-time identification of very simple grammars from positive data , 2003, Theor. Comput. Sci..

[9] Alexander Okhotin. An overview of conjunctive grammars, Formal Language Theory Column , 2003, Bull. EATCS.