A Polynomial Algorithm for the Inference of Context Free Languages-Reference-Cited by-同舟云学术

A Polynomial Algorithm for the Inference of Context Free Languages

Published: Issue: Volume: Page:29-42
ISSN:0302-9743
Container-title:Grammatical Inference: Algorithms and Applications
language:
Short-container-title:

Author:

Clark Alexander,Eyraud Rémi,Habrard Amaury

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-88009-7_3.pdf

Reference15 articles.

1. Lecture Notes in Artificial Intelligence;C.D.L. Higuera,2002

2. Yokomori, T.: Polynomial-time identification of very simple grammars from positive data. Theoretical Computer Science 298(1), 179–206 (2003)

3. Clark, A., Eyraud, R.: Polynomial identification in the limit of substitutable context-free languages. Journal of Machine Learning Research 8, 1725–1745 (2007)

4. Marcus, S.: Algebraic Linguistics; Analytical Models. Academic Press, N. Y (1967)

5. Gazdar, G., Klein, E., Pullum, G., Sag, I.: Generalised Phrase Structure Grammar. Basil Blackwell, Malden (1985)

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

1. Learning Highly Recursive Input Grammars;2021 36th IEEE/ACM International Conference on Automated Software Engineering (ASE);2021-11

2. Synthesizing Context-free Grammars from Recurrent Neural Networks;Tools and Algorithms for the Construction and Analysis of Systems;2021

3. Grammatical Inference for Computational Linguistics;Synthesis Lectures on Human Language Technologies;2015-10-23

4. On Context-Diverse Repeats and Their Incremental Computation;Language and Automata Theory and Applications;2014

5. Semantic separator learning and its applications in unsupervised Chinese text parsing;Frontiers of Computer Science;2013-01-09