Distributional Learning of Context-Free and Multiple Context-Free Grammars-Reference-Cited by-同舟云学术

Distributional Learning of Context-Free and Multiple Context-Free Grammars

Published:2016 Issue: Volume: Page:143-172
ISSN:
Container-title:Topics in Grammatical Inference
language:
Short-container-title:

Author:

Clark Alexander,Yoshinaka Ryo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-48395-4_6

Reference70 articles.

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

2. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(2), 87–106 (1987)

3. Angluin, D., Kharitonov, M.: When won’t membership queries help? J. Comput. Syst. Sci. 50, 336–355 (1995)

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

5. Brill, E., Magermann, D., Marcus, M., Santorini, B.: Deducing linguistic structure from the statistics of large corpora. In: Proceedings of the Third DARPA Workshop on Speech and Natural Language, pp. 275–282 (1990)

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

1. Extracting automata from recurrent neural networks using queries and counterexamples (extended version);Machine Learning;2022-06-08

2. The Chomsky Hierarchy 1;A Companion to Chomsky;2021-04-27

3. Consistent Unsupervised Estimators for Anchored PCFGs;Transactions of the Association for Computational Linguistics;2020-07-01

4. Exact Learning of Primitive Formal Systems Defining Labeled Ordered Tree Languages via Queries;IEICE Transactions on Information and Systems;2019-03-01

5. The Strong, Weak, and Very Weak Finite Context and Kernel Properties;Language and Automata Theory and Applications;2017