Grammatical Inference: Learning Automata and Grammars
Explore this paper's citation graph
Summary
The author describes a number of techniques and algorithms that allow us to learn from text, from an informant, or through interaction with the environment that concern automata, grammars, rewriting systems, pattern languages or transducers.
- Type
- preprint
- Published
- 2010-04-24
- Cited by
- 235
- References
- 348
- OpenAlex
- https://openalex.org/W138607541
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:267805923
Keywords
Grammar induction, Rule-based machine translation, Computer science, Artificial intelligence, Natural language processing
References
- PROBABILISTIC GRAPH GRAMMARS
- Learning Locally Testable Languages in the Strict Sense
- Grammar Discovery as Data Compression
- Statistical language learning
- A Grammar Inference Algorithm for the World Wide Web
- On the learnibility of Mildly Context-Sensitive languages using positive data and correction queries
- Accurate Computation of the Relative Entropy Between Stochastic Regular Grammars
- Stochastic Context-Free Grammar Induction with a Genetic Algorithm Using Local Search
- GA-based Learning of Context-Free Grammars using Tabular Representations
- Information Theory: 1948-1998 - Guest Editorial
- Eléments de théorie des automates
- Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology
- Equivalence and Reduction of Hidden Markov Models
- Some Statistical-Estimation Methods for Stochastic Finite-State Transducers
- On the power of equivalence queries
- Algorithms on strings
- Transductions and context-free languages
- Statistical methods for speech recognition
- Learning Regular Languages from Simple Positive Examples
- Kernel Methods for Pattern Analysis
Cited by
- Process Support and Knowledge Representation in Health Care
- Studies on verification of wireless sensor networks and abstraction learning for system inference
- Auction optimization using regression trees and linear models as integer programs
- ReverX: Reverse Engineering of Protocols
- Learning Regular Languages over Large Ordered Alphabets
- Learning finite-state machines: statistical and algorithmic aspects
- Cross-Model Queries and Schemas: Complexity and Learning. (Requêtes et Schémas Hétérogènes : Complexité et Apprentissage)
- Motif discovery in spatial trajectories using grammar inference
- Polynomial characteristic sets for DFA identification
- Sentence and Word Complexity
- A Paradigm for Learning Queries on Big Data
- Four one-shot learners for regular tree languages and their polynomial characterizability
- PCFG Induction for Unsupervised Parsing and Language Modelling
- Estimating Strictly Piecewise Distributions
- Learning Probabilistic Automata for Model Checking
- Collective Phenomena and Non-Finite State Computation in a Human Social System
- Integration testing of communicating systems with unknown components
- Analysis and testing of black‐box component‐based systems by inferring partial models
- The neurobiology of syntax: beyond string sets
- Inference and analysis of formal models of botnet command and control protocols
Related papers
- Learning Stochastic Context-Free Grammars from Corpora Using a Genetic Algorithm.
- Completeness of Compositional Translation for Context-Free Grammars
- On the Generative Power of Multiple Context-Free Grammars and Macro Grammars
- On Normal Forms and Erasing Rules in Path Controlled Grammars
- Decision Problems on Path-Controlled Grammars
- From context-free grammars with priorities to character class grammars