PAC-Learning Unambiguous NTS Languages-Reference-Cited by-同舟云学术

PAC-Learning Unambiguous NTS Languages

Published:2006 Issue: Volume: Page:59-71
ISSN:0302-9743
Container-title:Grammatical Inference: Algorithms and Applications
language:
Short-container-title:

Author:

Clark Alexander

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11872436_6.pdf

Reference13 articles.

1. Adriaans, P.: Learning shallow context-free languages under simple distributions. Technical Report ILLC Report PP-1999-13, Institute for Logic, Language and Computation, Amsterdam (1999)

2. Boasson, L., Senizergues, S.: NTS languages are deterministic and congruential. J. Comput. Syst. Sci. 31(3), 332–342 (1985)

3. LNAI;A. Clark,2005

4. Charniak, E.: Immediate head parsing for language models. In: Proceedings of the 39th annual meeting of the ACL, Toulouse, France, pp. 116–123 (2001)

5. Clark, A.: Learning deterministic context free grammars in the Omphalos competition. Machine Learning (to appear, 2006)

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

1. Learning (k,l)-context-sensitive probabilistic grammars with nonparametric Bayesian approach;Machine Learning;2021-07-16

2. Distributional Learning of Context-Free and Multiple Context-Free Grammars;Topics in Grammatical Inference;2016

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

4. Learnability;The Handbook of Language Emergence;2015-01-02

5. PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data;Lecture Notes in Computer Science;2013