Learning structurally reversible context-free grammars from queries and counterexamples in polynomial time

Authors:
Andrey Burago
Affiliations:
Department of Computer Science, University of Maryland, College Park MD
Venue:
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Year:
1994

Citing 7
Cited 2

An easy proof of Greibach normal form

Information and Control
Learning regular sets from queries and counterexamples

Information and Computation
Polynomial-time learning of very simple grammars from positive data

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Inference of Reversible Languages

Journal of the ACM (JACM)
Inductive Inference: Theory and Methods

ACM Computing Surveys (CSUR)
Queries and Concept Learning

Machine Learning
Queries and Concept Learning

Machine Learning

Polynomial time learning of simple deterministic languages via queries and a representative sample

Theoretical Computer Science
Quantitative structural information for inferring context free grammars with an extended Cocke-Younger-Kasami algorithm

Pattern Recognition Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present an algorithm to learn languages defined by structurally reversible deterministic context-free grammars from queries and counterexamples. The algorithm works in time polynomial in input size and the size of the original grammar.A context-free grammar is said to be structurally reversible if among all non-terminal strings that might derive a given terminal string, no one is an extension of the other.The concept of learning from queries and counterexamples was introduced by D. Angluin in 1987. She showed that regular languages are polynomial-time learnable from queries and counterexamples. Since that paper there has been considerable interest in extending the result to a larger class of languages.Among structurally reversible grammars there are very simple grammars which have been recently investigated towards learnability, and weighted grammars. As the complexity of algorithm presented here does not depend on the terminal alphabet size, it is applicable to learning left Szilard languages.Weighted grammars are grammars with integer weights assigned to all symbols such that each rule preserves the weight. The vast majority context-free languages used in practice (for example, most programming languages) can be generated by weighted grammars.