Supercombinator driven grammar reconstruction
暂无分享,去创建一个
[1] Erik Cambria,et al. Jumping NLP Curves: A Review of Natural Language Processing Research [Review Article] , 2014, IEEE Computational Intelligence Magazine.
[2] Johan Bos,et al. Developing a large semantically annotated corpus , 2012, LREC.
[3] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..
[4] James R. Cordy,et al. Grammatical Inference in Software Engineering: An Overview of the State of the Art , 2012, SLE.
[5] Ralf Lämmel,et al. Towards an engineering discipline for GRAMMARWARE Draft as of August 17 , 2003 , 2003 .
[6] Ján Kollár,et al. Supercombinator set construction from a context-free representation of text , 2016, 2016 Federated Conference on Computer Science and Information Systems (FedCSIS).
[7] Ján,et al. ABSTRACT LANGUAGE OF THE MACHINE MIND , 2016 .
[8] Ian H. Witten,et al. Identifying Hierarchical Structure in Sequences: A linear-time algorithm , 1997, J. Artif. Intell. Res..
[9] R. J. M. Hughes,et al. Super-combinators a new implementation method for applicative languages , 1982, LFP '82.
[10] Ján Kollár,et al. Towards machine mind evolution , 2015, 2015 Federated Conference on Computer Science and Information Systems (FedCSIS).
[11] Ján Kollár,et al. Properties and limits of supercombinator set acquired from context-free grammar samples , 2017, 2017 Federated Conference on Computer Science and Information Systems (FedCSIS).
[12] Mark Steedman,et al. Combinatory Categorial Grammar , 2011 .