Learning Tree Languages from Text-Reference-Cited by-同舟云学术

Learning Tree Languages from Text

Published:2002 Issue: Volume: Page:153-168
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Fernau Henning

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45435-7_11

Reference32 articles.

1. D. Angluin. Inductive inference of formal languages from positive data. Information and Control, 45:117–135, 1980.

2. D. Angluin. Inference of reversible languages. Journal of the Association for Computing Machinery, 29(3):741–765, 1982.

3. M. Bernard and C. de la Higuera. GIFT: Grammatical Inference For Terms. International Conference on Inductive Logic Programming ILP. Late Breaking Paper, 1999. French journal version: Apprentissage de programmes logiques par inférence grammaticale. Revue d’Intelligence Artificielle, 14:375–396, 2001.

4. J. Besombes and J.-Y. Marion. Identification of reversible dependency tree languages. In L. Popelínský and M. Nepil, editors, Proceedings of 3rd Workshop on Learning Languages in Logic LLL’01, pages 11–22, 2001.

5. S. Crespi-Reghizzi, M. A. Melkanoff, and L. Lichten. The use of grammatical inference for designing programming languages. Communications of the ACM, 16:83–90, 1972.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. LARS: A learning algorithm for rewriting systems;Machine Learning;2006-08-04

2. A bibliographical study of grammatical inference;Pattern Recognition;2005-09

3. Syntactic Modeling and Recognition of Document Images;Lecture Notes in Computer Science;2004

4. Efficient Learning of k-Reversible Context-Free Grammars from Positive Structural Examples;Grammatical Inference: Algorithms and Applications;2004

5. Learning Tree Languages from Positive Examples and Membership Queries;Lecture Notes in Computer Science;2004