An algorithm for constructing an even grammar from a language sample

Authors:
Margaret Francel;David J. John
Affiliations:
The Citadel, Charleston, South Carolina;Wake Forest University, Winston-Salem, North Carolina
Venue:
ACM-SE 42 Proceedings of the 42nd annual Southeast regional conference
Year:
2004

Citing 7
Cited 1

Inference of even linear grammars and its applications to picture description languages

Pattern Recognition
Learning deterministic even linear languages from positive examples

Theoretical Computer Science - Special issue on algorithmic learning theory
Inductive Inference: Theory and Methods

ACM Computing Surveys (CSUR)
Introduction to the Theory of Computation

Introduction to the Theory of Computation
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Learning a Subclass of Linear Languages from Positive Structural Information

ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
Learning linear grammars from structural information

ICG! '96 Proceedings of the 3rd International Colloquium on Grammatical Inference: Learning Syntax from Sentences

Constructing an even grammar from a 2-element sample

Proceedings of the 43rd annual Southeast regional conference - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two skeleton based algorithms are presented for the grammatical inference problem. The first demonstrates the use of a new relation on internal skeleton nodes that focuses on decedent information. The second addresses those positive samples that contain repeated substrings.