{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T12:10:03Z","timestamp":1752149403738,"version":"3.41.2"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1987,3,1]],"date-time":"1987-03-01T00:00:00Z","timestamp":541555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1987,3,1]],"date-time":"1987-03-01T00:00:00Z","timestamp":541555200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Learning"],"published-print":{"date-parts":[[1987,3]]},"DOI":"10.1023\/a:1022808826027","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T16:57:10Z","timestamp":1049475430000},"page":"5-8","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Machine Learning and Grammar Induction"],"prefix":"10.1007","volume":"2","author":[{"given":"Pat","family":"Langely","sequence":"first","affiliation":[]}],"member":"297","reference":[{"unstructured":"Anderson, J.R.(1977).Induction of augmented transition networks.Cog-nitive Science,1125-157.","key":"422905_CR1"},{"doi-asserted-by":"crossref","unstructured":"Angluin, D.(1982).Inference of reversible languages.Journal of the As-sociation for Computing Machinery,29741-765.","key":"422905_CR2","DOI":"10.1145\/322326.322334"},{"doi-asserted-by":"crossref","unstructured":"Gold, E.M.(1967).Language identification in the limit.Information and Control,10447-474.","key":"422905_CR3","DOI":"10.1016\/S0019-9958(67)91165-5"},{"unstructured":"Klein, S.,& Kuppin, M.A.(1970).An interactive,heuristic program for learning transformational grammar(Technical Report No.97).Madi-son:University of Wisconsin,Department of Computer Science.","key":"422905_CR4"},{"doi-asserted-by":"crossref","unstructured":"Mitchell, T.M.(1982).Generalization as search.Artificial Intelligence, 18203-226","key":"422905_CR5","DOI":"10.1016\/0004-3702(82)90040-6"},{"unstructured":"Sik\u00f3ssy, L.(1972).Natural language learning by computer.In H.A. Simon & L. Siklossy (Eds.),Representation and meaning:Experiments with information processing systems.Englewood Cliffs,NJ: Prentice-Hall.","key":"422905_CR6"},{"unstructured":"Solomonoff, R.(1959).A new method for discovering the grammars of phrase structure languages.Proceedings of the International Confer-ence on Information Processing.","key":"422905_CR7"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022808826027.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1022808826027\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022808826027.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:42:32Z","timestamp":1752147752000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1022808826027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,3]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,3]]}},"alternative-id":["422905"],"URL":"https:\/\/doi.org\/10.1023\/a:1022808826027","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[1987,3]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}