{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:42Z","timestamp":1725559002593},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540257837"},{"type":"electronic","value":"9783540319535"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11422532_20","type":"book-chapter","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T22:15:43Z","timestamp":1278972943000},"page":"301-316","source":"Crossref","is-referenced-by-count":2,"title":["When Categorial Grammars Meet Regular Grammatical Inference"],"prefix":"10.1007","author":[{"given":"Isabelle","family":"Tellier","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1145\/322326.322334","volume":"3","author":"D. Angluin","year":"1982","unstructured":"Angluin, D.: Inference of Reversible Languages. Journal of the ACM\u00a03, 741\u2013765 (1982)","journal-title":"Journal of the ACM"},{"unstructured":"Hillel, Y.B., Gaifman, C., Shamir, E.: On Categorial and Phrase Structure Grammars. Bulletin of the Research Council of Israel\u00a09F (1960)","key":"20_CR2"},{"doi-asserted-by":"crossref","unstructured":"Besombes, J., Marion, J.-Y.: newblock Learning Reversible Categorial Grammars from Structures newblock proceedings of Categorial Grammars 148\u2013163 (2004)","key":"20_CR3","DOI":"10.1007\/978-3-540-39985-8_19"},{"doi-asserted-by":"crossref","unstructured":"Buszkowki, W., Penn, G.: Categorial grammars determined from linguistic data by unification. Studia Logica, 431\u2013454 (1990)","key":"20_CR4","DOI":"10.1007\/BF00370157"},{"key":"20_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-48199-0_8","volume-title":"Logical Aspects of Computational Linguistics","author":"C. Costa Flor\u00eancio","year":"2001","unstructured":"Costa Flor\u00eancio, C.: Consistent identification in the limit of any of the classes k-valued is NP-hard. In: de Groote, P., Morrill, G., Retor\u00e9, C. (eds.) LACL 2001. LNCS (LNAI), vol.\u00a02099, pp. 125\u2013134. Springer, Heidelberg (2001)"},{"key":"20_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-45790-9_5","volume-title":"Grammatical Inference: Algorithms and Applications","author":"C. Costa-Florencio","year":"2002","unstructured":"Costa-Florencio, C.: Consistent identification in the limit of rigid grammars from strings is NP-hard. In: Adriaans, P.W., Fernau, H., van Zaanen, M. (eds.) ICGI 2002. LNCS (LNAI), vol.\u00a02484, pp. 49\u201362. Springer, Heidelberg (2002)"},{"doi-asserted-by":"crossref","unstructured":"Denis, F., Lemay, A., Terlutte, A.: Some language classes identifiable in the limit from positive data. In: proceedings of the ICGI: Algorithms and Applications. LNCS (LNAI), vol.\u00a02484, pp. 63\u201376 (2002)","key":"20_CR7","DOI":"10.1007\/3-540-45790-9_6"},{"doi-asserted-by":"crossref","unstructured":"Dupont, P., Miclet, L., Vidal, E.: What is the search space of the regular inference. proceedings of ICGI. LNCS, vol.\u00a0862, pp. 25\u201337 (1994)","key":"20_CR8","DOI":"10.1007\/3-540-58473-0_134"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Information and Control\u00a010, 447\u2013474 (1967)","journal-title":"Information and Control"},{"unstructured":"Huet, G., Retore, C.: Survey of a few fundamental representation structures for computational linguistics. In: ESSLI 2002 lecture (2002)","key":"20_CR10"},{"key":"20_CR11","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-3-642-59126-6_2","volume-title":"Handbook of Formal Languages","author":"A. Joshi","year":"1997","unstructured":"Joshi, A., Schabes, Y.: Tree-Adjoining Grammars. In: Handbook of Formal Languages, vol.\u00a03, pp. 69\u2013120. Springer, Heidelberg (1997)"},{"key":"20_CR12","volume-title":"Learnable Classes of Categorial Grammars","author":"M. Kanazawa","year":"1998","unstructured":"Kanazawa, M.: Learnable Classes of Categorial Grammars. CSLI Publications, Stanford (1998)"},{"key":"20_CR13","first-page":"99","volume-title":"Advances in Structural and Syntactic Pattern Recognition","author":"J. Oncina","year":"1992","unstructured":"Oncina, J., Garcia, P.: Identifying regular languages in polynomial time. In: Advances in Structural and Syntactic Pattern Recognition, vol.\u00a05, pp. 99\u2013108. World Scientific, Singapore (1992)"}],"container-title":["Lecture Notes in Computer Science","Logical Aspects of Computational Linguistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11422532_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:54:38Z","timestamp":1558281278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11422532_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540257837","9783540319535"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11422532_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}