Recommendations
- scientific article; zbMATH DE number 2089360
- Learning tree languages from text
- scientific article; zbMATH DE number 2040913
- Languages of Nested Trees
- General varieties of tree languages
- scientific article; zbMATH DE number 4108163
- scientific article; zbMATH DE number 475413
- scientific article; zbMATH DE number 54244
- Learning Rational Stochastic Tree Languages
- scientific article; zbMATH DE number 3945364
Cites work
- A Note on the k-Tail Method of Tree Grammar Inference
- A similarity between probabilistic tree languages: Application to XML document families.
- A theory of the learnable
- Algorithms for learning regular expressions from positive data
- Automata for XML -- a survey
- Biological Sequence Analysis
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
- Complexity of automaton identification from given data
- Computing approximate tree edit distance using relaxation labeling
- Derivatives of Tree Sets with Applications to Grammatical Inference
- Error-correcting tree language inference
- Existential second-order logic over graphs: charting the tractability frontier
- Finding tree patterns consistent with positive and negative examples using queries
- Four one-shot learners for regular tree languages and their polynomial characterizability
- Grammatical inference. Learning automata and grammars.
- Hamilton-Jacobi skeletons
- Hierarchical phrase-based translation
- scientific article; zbMATH DE number 5854939 (Why is no real title available?)
- scientific article; zbMATH DE number 996385 (Why is no real title available?)
- scientific article; zbMATH DE number 41348 (Why is no real title available?)
- scientific article; zbMATH DE number 1233727 (Why is no real title available?)
- scientific article; zbMATH DE number 1104352 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- Identification in the limit of categorial grammars
- Identification of function distinguishable languages.
- Inducing tree-substitution grammars
- Inference of tree automata from sample set of trees
- Inferring a tree from walks
- Language identification in the limit
- Learning \((k,l)\)-contextual tree languages for information extraction from web pages
- Learning context-free grammars from structural data in polynomial time
- Learning deterministically recognizable tree series
- Learning regular tree languages from correction and equivalence queries
- Learning structural shape descriptions from examples
- Learning tree languages from positive examples and membership queries
- Learning tree languages from text
- MAT learners for tree series: an abstract data type and two realizations
- On families of categorial grammars of bounded value, their learnability and related complexity questions
- On inferring linear single-tree languages
- On learning unions of pattern languages and tree patterns in the mistake bound model.
- On notions of regularity for data languages
- On the complexity of teaching
- Ordered term tree languages which are polynomial time inductively inferable from positive data
- Query induction with schema-guided pruning strategies
- Query learning of regular tree languages: How to avoid dead states
- The inference of tree languages from finite samples: An algebraic approach
- Toward a mathematical theory of inductive inference
- Tree adjunct grammars
- Weighted automata and weighted logics
- Weighted tree automata and weighted logics
Cited in
(5)- The inference of tree languages from finite samples: An algebraic approach
- Querying linguistic trees
- scientific article; zbMATH DE number 3880129 (Why is no real title available?)
- scientific article; zbMATH DE number 3913711 (Why is no real title available?)
- scientific article; zbMATH DE number 2040913 (Why is no real title available?)
This page was built for publication: Learning Tree Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963598)
