{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T22:10:22Z","timestamp":1740262222460,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540257837"},{"type":"electronic","value":"9783540319535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11422532_13","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T02:15:43Z","timestamp":1278987343000},"page":"189-204","source":"Crossref","is-referenced-by-count":0,"title":["Learnable Classes of General Combinatory Grammars"],"prefix":"10.1007","author":[{"given":"Erwan","family":"Moreau","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","volume-title":"Learnable classes of categorial grammars","author":"M. Kanazawa","year":"1998","unstructured":"Kanazawa, M.: Learnable classes of categorial grammars. Cambridge University Press, Cambridge (1998)"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. Gold","year":"1967","unstructured":"Gold, E.: Language identification in the limit. Information and control\u00a010, 447\u2013474 (1967)","journal-title":"Information and control"},{"key":"13_CR3","unstructured":"Buszkowski, W., Penn, G.: Categorial grammars determined from linguistic data by unification. Technical Report TR-89-05, Department of Computer Science, University of Chicago (1989)"},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/B978-0-08-094829-4.50026-X","volume-title":"Proceedings of the Second Annual Workshop on Computational Learning Theory","author":"K. Wright","year":"1989","unstructured":"Wright, K.: Identification of unions of languages drawn from an identifiable class. In: Proceedings of the Second Annual Workshop on Computational Learning Theory, pp. 328\u2013333. Morgan Kaufmann, San Francisco (1989)"},{"key":"13_CR5","first-page":"375","volume-title":"Proceedings of the Fourth Annual Workshop on Computational Learning Theory","author":"T. Motoki","year":"1991","unstructured":"Motoki, T., Shinohara, T., Wright, K.: The correct definition of finite elasticity: corrigendum to Identification of unions. In: Proceedings of the Fourth Annual Workshop on Computational Learning Theory, San Mateo, CA, p. 375. Morgan Kaufmann, San Francisco (1991)"},{"key":"13_CR6","unstructured":"Costa Flor\u00eancio, C.: Combinatory categorial grammars and finite elasticity. In: Hoste, V., Pauw, G.D. (eds.) Proceedings of the Eleventh Belgian-Dutch Conference on Machine Learning, pp. 13\u201318. University of Antwerp (2001)"},{"key":"13_CR7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6591.001.0001","volume-title":"The Syntactic Process","author":"M. Steedman","year":"2000","unstructured":"Steedman, M.: The Syntactic Process. The MIT Press, Cambridge (2000)"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/BF03037094","volume":"8","author":"T. Shinohara","year":"1991","unstructured":"Shinohara, T.: Inductive inference of monotonic formal systems from positive data. New Generation Computing\u00a08, 371\u2013384 (1991)","journal-title":"New Generation Computing"},{"key":"13_CR9","unstructured":"Costa Flor\u00eancio, C.: Learning categorial grammars. PhD thesis, Utrecht University (2003)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Besombes, J., Marion, J.Y.: Learning reversible categorial grammars from structures. In: Proceedings of Categorial Grammars 2004, Montpellier, France, pp. 148\u2013163 (2004)","DOI":"10.1007\/978-3-540-39985-8_19"},{"key":"13_CR11","unstructured":"Bar-Hillel, Y., Gaifman, C., Shamir, E.: On categorial and phrase structure grammars (1960)"},{"key":"13_CR12","unstructured":"B\u00e9chet, D., Dikovsky, A., Foret, A., Moreau, E.: On learning discontinuous dependencies from positive data. In: Proceedings of the 9th conference on Formal Grammar (2004)"},{"key":"13_CR13","unstructured":"Hockenmaier, J.: Data and models for statistical parsing with Combinatory Categorial Grammar. PhD thesis, School of Informatics, The University of Edinburgh (2003)"},{"key":"13_CR14","unstructured":"Sleator, D.D.K., Temperley, D.: Parsing english with a link grammar. Technical Report CMU-CS-TR-91-126, Carnegie Mellon University, Pittsburgh, PA (1991)"},{"key":"13_CR15","unstructured":"Temperley, D., Sleator, D., Lafferty, J.: Link grammar (1991), http:\/\/hyper.link.cs.cmu.edu\/link\/"},{"key":"13_CR16","unstructured":"B\u00e9chet, D.: k-valued link grammars are learnable from strings. In: Proceedings Formal Grammars 2003, pp. 9\u201318 (2003)"},{"key":"13_CR17","unstructured":"Moreau, E.: From link grammars to categorial grammars. In: Proceedings of Categorial Grammars 2004, Montpellier, France, pp. 31\u201345 (2004)"}],"container-title":["Lecture Notes in Computer Science","Logical Aspects of Computational Linguistics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11422532_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T21:31:53Z","timestamp":1740259913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11422532_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540257837","9783540319535"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11422532_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}