A Learnable Representation for Syntax Using Residuated Lattices-Reference-Cited by-同舟云学术

A Learnable Representation for Syntax Using Residuated Lattices

Published:2011 Issue: Volume: Page:183-198
ISSN:0302-9743
Container-title:Formal Grammar
language:
Short-container-title:

Author:

Clark Alexander

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-20169-1_12

Reference19 articles.

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

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

3. Lecture Notes in Artificial Intelligence;A. Clark,2008

4. Harris, Z.: Distributional structure. In: Fodor, J.A., Katz, J.J. (eds.) The Structure of Language, pp. 33–49. Prentice-Hall, Englewood Cliffs (1954)

5. Sestier, A.: Contribution à une théorie ensembliste des classifications linguistiques. In: Premier Congrès de l’Association Française de Calcul, Grenoble, pp. 293–305 (1960)

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

1. Categorial Grammars and Their Logics;Studies in Universal Logic;2018

2. Language-Theoretic and Finite Relation Models for the (Full) Lambek Calculus;Journal of Logic, Language and Information;2017-03-30

3. Distributional Learning of Regular Formal Graph System of Bounded Degree;Inductive Logic Programming;2017

4. Automatic Concepts and Automata-Theoretic Semantics for the Full Lambek Calculus;Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016);2016

5. On Some Extensions of Syntactic Concept Lattices: Completeness and Finiteness Results;Formal Grammar;2016