Topics in Grammatical Inference

No abstract is available for this paper.

• Publication year

  2016

• Venue

  Springer Berlin Heidelberg

• Publication date

  2016-05-05

• Fields of study

  Linguistics, Computer Science

• Identifiers
  DOI 10.1007/978-3-662-48395-4
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Statistical Machine Translation

  2014cited by this paper
• PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data

  2013influential reference
• Completeness of Full Lambek Calculus for Syntactic Concept Lattices

  2013cited by this paper
• Fast Learning of Restricted Regular Expressions and DTDs

  2013cited by this paper
• Four one-shot learners for regular tree languages and their polynomial characterizability

  2013cited by this paper
• Proceedings Machines, Computations and Universality 2013: Formal Language Questions for Eulerian Trails

  2013cited by this paper
• Query induction with schema-guided pruning strategies

  2013cited by this paper
• I and J

  2012cited by this paper
• Inference of k-Testable Directed Acyclic Graph Languages

  2012cited by this paper
• Active learning for interactive machine translation

  2012cited by this paper
• Basics on Tree Automata

  2012cited by this paper
• Spectral Learning for Non-Deterministic Dependency Parsing

  2012cited by this paper
• Distributional Learning of Simple Context-Free Tree Grammars

  2011cited by this paper
• Polynomial Time Inductive Inference of Cograph Pattern Languages from Positive Data

  2011cited by this paper
• Rule Markov Models for Fast Tree-to-String Translation

  2011cited by this paper
• Estudio de la mezcla de estados determinista y no determinista en el diseño de algoritmos para inferencia gramatical de lenguajes regulares.

  2011influential reference
• Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices

  2011cited by this paper
• Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data

  2011cited by this paper
• Distributional Learning of Abstract Categorial Grammars

  2011cited by this paper
• Efficient learning of multiple context-free languages with multidimensional substitutability from positive data

  2011cited by this paper
• Generalizing over Several Learning Settings

  2010cited by this paper
• Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher

  2010cited by this paper
• Grammatical Inference: Learning Automata and Grammars

  2010influential reference
• Survey: Tree Transducers in Machine Translation

  2010cited by this paper
• A learning algorithm for top-down XML transformations

  2010cited by this paper
• Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries

  2010cited by this paper
• Correction Queries in Active Learning

  2010cited by this paper
• Weighted Tree Automata and Tree Transducers

  2009cited by this paper
• Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data

  2009cited by this paper
• A Polynomial Time Algorithm for Finding a Minimally Generalized Linear Interval Graph Pattern

  2009cited by this paper
• Algorithms for learning regular expressions from positive data

  2009cited by this paper
• Making Finite-State Methods Applicable to Languages Beyond Context-Freeness via Multi-dimensional Trees

  2009cited by this paper
• Identification in the Limit of k, l-Substitutable Context-Free Languages

  2008cited by this paper
• Forest-Based Translation

  2008cited by this paper
• Logics and Automata for Totally Ordered Trees

  2008cited by this paper
• On Learning Regular Expressions and Patterns Via Membership and Correction Queries

  2008cited by this paper
• A Note on Inductive Generalization

  2008cited by this paper
• The universal automaton

  2008influential reference
• On the Inference of Linear Single Tree Grammars from Positive Structural Information

  2007cited by this paper
• Learning Deterministically Recognizable Tree Series - Revisited

  2007cited by this paper
• Grammar-Based Classifier System for Recognition of Promoter Regions

  2007cited by this paper
• Characterizing Membrane Structures Through Multiset Tree Automata

  2007cited by this paper
• Fast and effective kernels for relational learning from texts

  2007cited by this paper
• Forest-to-String Statistical Translation Rules

  2007cited by this paper
• Learning Regular Tree Languages from Correction and Equivalence Queries

  2007cited by this paper
• Automata for XML - A survey

  2007cited by this paper
• Learning shape-classes using a mixture of tree-unions

  2006cited by this paper
• Learning in varieties of the form V*LI from positive data

  2006influential reference
• Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples

  2006cited by this paper
• Weighted tree automata and weighted logics

  2006cited by this paper
• Expressiveness and complexity of XML Schema

  2006cited by this paper
• Identifying P Rules from Membrane Structures with an Error-Correcting Approach

  2006cited by this paper
• Influence of cultivation temperature on the ligninolytic activity of selected fungal strains

  2006influential reference
• Induction of Probabilistic Synchronous Tree-Insertion Grammars for Machine Translation

  2006cited by this paper
• Learning Accurate, Compact, and Interpretable Tree Annotation

  2006cited by this paper
• Discovery of Maximally Frequent Tag Tree Patterns with Height-Constrained Variables from Semistructured Web Documents

  2005cited by this paper
• BIOINFORMATICS ORIGINAL PAPER Sequence analysis Pair stochastic tree adjoining grammars for aligning and predicting pseudoknot RNA structures

  2005cited by this paper
• An Overview of Probabilistic Tree Transducers for Natural Language Processing

  2005cited by this paper
• A bibliographical study of grammatical inference

  2005influential reference
• Dependency Treelet Translation: Syntactically Informed Phrasal SMT

  2005cited by this paper
• Weighted automata and weighted logics

  2005cited by this paper
• How to use crowding selection in grammar-based classifier system

  2005cited by this paper
• Training Tree Transducers

  2004cited by this paper
• Learning Distinguishable Linear Grammars from Positive Data

  2004cited by this paper
• Inference of reversible tree languages

  2004cited by this paper
• Minimalizations of NFA using the universal automaton

  2004influential reference
• Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA

  2004influential reference
• Learning of Ordered Tree Languages with Height-Bounded Variables Using Queries

  2004cited by this paper
• Polynomial Time Inductive Inference of Ordered Tree Languages with Height-Constrained Variables from Positive Data

  2004cited by this paper
• NFA reduction algorithms by means of regular inequalities

  2004influential reference
• Inference of K-Piecewise Testable Tree Languages

  2003cited by this paper
• Pair hidden Markov models on tree structures

  2003cited by this paper
• Unambiguous Automata Inference by Means of State-Merging Methods

  2003influential reference
• Reducing NFAs by invariant equivalences

  2003influential reference
• Inducing Grammars from Sparse Data Sets: A Survey of Algorithms and Results

  2003influential reference
• Use of Learning Classifier System for Inferring Natural Language Grammar

  2003cited by this paper
• Biological sequence analysis

  2003cited by this paper
• Inference of recognizable tree sets

  2003cited by this paper
• Learning Decision Trees and Tree Automata for a Syntactic Pattern Recognition Task

  2003cited by this paper
• Learning k-Testable tree sets from positive data*

  2003cited by this paper
• Computing approximate tree edit distance using relaxation labeling

  2003cited by this paper
• Learning Structural Variations in Shock Trees

  2002cited by this paper
• On learning unions of pattern languages and tree patterns in the mistake bound model

  2002cited by this paper
• Learning tree languages from text

  2002cited by this paper
• Residual Finite State Automata

  2002influential reference
• Automata, Logic, and XML

  2002cited by this paper
• Hamilton-Jacobi Skeletons

  2002cited by this paper
• Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries

  2002cited by this paper
• Error-correcting tree language inference

  2002cited by this paper
• Ordered term tree languages which are polynomial time inductively inferable from positive data

  2002cited by this paper
• Automata-and Logic-Based Pattern Languages for Tree-Structured Data

  2001cited by this paper
• Discovering Shape Categories by Clustering Shock Trees

  2001cited by this paper
• Learning Regular Languages Using RFSA

  2001influential reference
• Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables

  2001cited by this paper
• ABL: Alignment-Based Learning

  2000influential reference
• Polynomial-time learning of elementary formal systems

  2000cited by this paper
• On inferring linear single-tree languages

  2000cited by this paper
• Syntactic Pattern Recognition by Error Correcting Analysis on Tree Automata

  2000cited by this paper
• A Comparative Study of Two Algorithms for Automata Identification

  2000influential reference
• Existential second-order logic over graphs: charting the tractability frontier

  2000cited by this paper

• Quantitative and Computational Approaches to Phonology

  2024cites this paper
• The Idea of Optimization for Self-Improving Systems

  2024cites this paper
• Algebraic Reanalysis of Phonological Processes Described as Output-Oriented

  2024cites this paper
• Grammar Inference for Ad Hoc Parsers

  2022cites this paper
• Strings from neurons to language

  2022cites this paper
• Action Signatures and Finite-State Variations

  2022cites this paper
• Melody learning and long-distance phonotactics in tone

  2020influential citation
• Improving Symbolic Automata Learning with Concolic Execution

  2020cites this paper
• Montague Grammar Induction

  2020cites this paper
• Mining input grammars from dynamic control flow

  2020cites this paper
• Answer Set Programming for Regular Inference

  2020cites this paper
• No free lunch in linguistics or machine learning: Response to Pater

  2019cites this paper
• No free lunch in linguistics or machine learning: Response to Pater

  2019cites this paper
• Inference of bounded L systems with polymorphic P systems

  2019cites this paper
• Language acquisition with communication between learners

  2018cites this paper
• Statistical Relational Learning With Unconventional String Models

  2018cites this paper
• Mining Input Grammars with AUTOGRAM

  2017cites this paper
• Human in the Loop: Interactive Passive Automata Learning via Evidence-Driven State-Merging Algorithms

  2017cites this paper
• Active Learning of Input Grammars

  2017cites this paper
• flexfringe: A Passive Automaton Learning Package

  2017cites this paper
• Computational learning of construction grammars

  2016cites this paper