{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T08:59:35Z","timestamp":1754557175788,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584735"},{"type":"electronic","value":"9783540489856"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58473-0_132","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:16:56Z","timestamp":1330273016000},"page":"5-15","source":"Crossref","is-referenced-by-count":1,"title":["Learning morphology \u2014 practice makes good"],"prefix":"10.1007","author":[{"given":"Alon","family":"Itai","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/356914.356918","volume":"15","author":"D. Angluin","year":"1983","unstructured":"Angluin, D. and C. Smith, \u201cInductive inference: theory and methods\u201d. Comput. Surveys, 15, 237\u2013269, (1983)","journal-title":"Comput. Surveys"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Barton, G. E., \u201cComputational complexity in two-level morphology\u201d. ACL '86, 53\u201359.","DOI":"10.3115\/981131.981140"},{"issue":"4","key":"2_CR3","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A. Blumer","year":"1989","unstructured":"Blumer A., A. Ehrenfeucht, D. Haussler and M. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, J. ACM, 36(4), 929\u2013965, (1989).","journal-title":"J. ACM"},{"key":"2_CR4","unstructured":"Harrison, M. A., Introduction to Formal Language Theory, Addison-Wesley, 1978."},{"key":"2_CR5","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, (1979)."},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"E. M. Gold","year":"1978","unstructured":"Gold, E. M., \u201cComplexity of automaton identification from given data\u201d. Information and Control, 37, 302\u2013320. (1978).","journal-title":"Information and Control"},{"key":"2_CR7","unstructured":"Koskenniemi, K. and K. W. Church. \u201cComplexity, Two-level morphology, and Finnish\u201d. COLING '88."},{"key":"2_CR8","unstructured":"Kataja, L., and K. Koskenniemi, \u201cFinite-state description of Semitic morphology: A case study of Ancient Akkadian\u201d."},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Kearns, M., and L. Valiant, \u201cCryptographic limitations on learning Boolean formulae and finite automata\u201d. Proc. 21st STPC, 433\u2013444, (1989).","DOI":"10.1145\/73007.73049"},{"key":"2_CR10","unstructured":"Koskenniemi, K., \u201cTwo-level morphology: A general computational model for word-form recognition and production\u201d. Publication No. 11, University of Helsinki, Dept. of General Linguistics, Hallituskata 11-33, SF-00100 Helsinki 10, Finland."},{"key":"2_CR11","volume-title":"On the applicability of Two Level morphology to the inflection of Hebrew verbs","author":"A. Itai","year":"1988","unstructured":"A. Itai, A. Lavie, U. Ornan and M. Rimon, \u201cOn the applicability of Two Level morphology to the inflection of Hebrew verbs\u201d. ALLC June 1988, Jerusalem, (TR 513, CS Department Technion)."},{"key":"2_CR12","first-page":"285","volume":"2","author":"N. Littlestone","year":"1987","unstructured":"Littlestone, N., \u201cLearning quickly when irrelevant attributes abound: a new linear threshold algorithm\u201d. Machine Learning 2, 285\u2013318, (1987).","journal-title":"Machine Learning"},{"key":"2_CR13","unstructured":"Littlestone, N., \u201cMistake bounds and logarithmic linear-threshold learning algorithms\u201d, Ph.D. Thesis, U.C. Santa Cruz, March 1989."},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1109\/34.211465","volume":"15","author":"J. Oncina","year":"1993","unstructured":"Oncina, J., P.Garc\u00eda, and E. Vidal, Learning subsequential transducers for pattern recognition interpretation tasks\u201d. IEEE Trans. Pattern Anal. and Machine Intell., 15, 448\u2013458, (1993)","journal-title":"IEEE Trans. Pattern Anal. and Machine Intell."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Pitt, L., and M. K. Warmuth, \u201cReduction among prediction problems: on the difficulty of predicting automata\u201d. Proc. of 3rd annual structure in complexity theory, (1988).","DOI":"10.1109\/SCT.1988.5263"},{"issue":"11","key":"2_CR16","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L.G. Valiant","year":"1984","unstructured":"Valiant L.G., A Theory of the Learnable, Comm. ACM, 27(11), 1134\u201342, (1984).","journal-title":"Comm. ACM"}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58473-0_132.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:31:16Z","timestamp":1742596276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58473-0_132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584735","9783540489856"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-58473-0_132","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}