Learning Tree Languages
From MaRDI portal
Publication:2963598
DOI10.1007/978-3-662-48395-4_7zbMath1404.68055OpenAlexW2463247697MaRDI QIDQ2963598
Johanna Björklund, Henning Fernau
Publication date: 15 February 2017
Published in: Topics in Grammatical Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48395-4_7
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On inferring linear single-tree languages
- Four one-shot learners for regular tree languages and their polynomial characterizability
- On families of categorial grammars of bounded value, their learnability and related complexity questions
- MAT learners for tree series: an abstract data type and two realizations
- Ordered term tree languages which are polynomial time inductively inferable from positive data
- On notions of regularity for data languages
- Weighted tree automata and weighted logics
- Query learning of regular tree languages: How to avoid dead states
- Automata for XML -- a survey
- Learning context-free grammars from structural data in polynomial time
- Learning \((k,l)\)-contextual tree languages for information extraction from web pages
- Algorithms for learning regular expressions from positive data
- Tree adjunct grammars
- Finding tree patterns consistent with positive and negative examples using queries
- The inference of tree languages from finite samples: An algebraic approach
- Inferring a tree from walks
- A similarity between probabilistic tree languages: Application to XML document families.
- Identification of function distinguishable languages.
- On learning unions of pattern languages and tree patterns in the mistake bound model.
- Hamilton-Jacobi skeletons
- On the complexity of teaching
- Identification in the limit of categorial grammars
- Weighted automata and weighted logics
- Learning tree languages from positive examples and membership queries
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
- Error-correcting tree language inference
- Hierarchical Phrase-Based Translation
- Learning tree languages from text
- Inference of tree automata from sample set of trees
- A theory of the learnable
- Derivatives of Tree Sets with Applications to Grammatical Inference
- A Note on the k-Tail Method of Tree Grammar Inference
- Complexity of automaton identification from given data
- Toward a mathematical theory of inductive inference
- Biological Sequence Analysis
- Computing approximate tree edit distance using relaxation labeling
- Learning structural shape descriptions from examples
- Existential second-order logic over graphs
- Language identification in the limit
This page was built for publication: Learning Tree Languages
