Learning tree languages from text

DOI10.1051/ITA:2007030zbMATH Open1144.68031OpenAlexW2038583573MaRDI QIDQ3512593FDOQ3512593

Authors: Henning Fernau 

Publication date: 21 July 2008

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2007__41_4_351_0

Recommendations

• scientific article; zbMATH DE number 2089360
• scientific article; zbMATH DE number 2040913
• Query learning of regular tree languages: How to avoid dead states
• Algorithmic Learning Theory
• Stochastic inference of regular tree languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32)

Cites Work

• Title not available (Why is that?)
• Learning regular sets from queries and counterexamples
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Title not available (Why is that?)
• Inference of Reversible Languages
• The inference of tree languages from finite samples: An algebraic approach
• Stochastic inference of regular tree languages
• Learning context-free grammars from structural data in polynomial time
• Efficient learning of context-free grammars from positive structural examples
• Title not available (Why is that?)
• Learning approximately regular languages with reversible languages
• Identification of function distinguishable languages.
• Title not available (Why is that?)
• Query learning of regular tree languages: How to avoid dead states
• Title not available (Why is that?)
• Polynomial-time identification of very simple grammars from positive data.
• The use of grammatical inference for designing programming languages
• Title not available (Why is that?)
• Error-Correcting Tree Automata for Syntactic Pattern Recognition
• Error-correcting tree language inference
• Error-Correcting Parsers for Formal Languages
• Algorithmic Learning Theory
• Title not available (Why is that?)
• Algorithmic Learning Theory
• Grammatical picture generation. A tree-based approach. With CD-ROM.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Inference of even linear grammars and its application to picture description languages
• Title not available (Why is that?)
• A method for inferring context-free grammars
• Inference of tree automata from sample set of trees
• Title not available (Why is that?)
• A similarity between probabilistic tree languages: Application to XML document families.
• Identifying terminal distinguishable languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Inductive inference of context-free languages based on context-free expressions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Grammatical Inference: Algorithms and Applications

Cited In (13)

• A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness
• Algorithmic Learning Theory
• Learning tree languages from positive examples and membership queries
• Stochastic inference of regular tree languages
• Querying linguistic trees
• The inference of tree languages from finite samples: An algebraic approach
• Learning Tree Languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Grammatical Inference: Algorithms and Applications
• Title not available (Why is that?)
• Identification of function distinguishable languages.

Uses Software

• XPath

This page was built for publication: Learning tree languages from text

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512593)