{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:10Z","timestamp":1725664570763},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540609254"},{"type":"electronic","value":"9783540497387"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-60925-3_46","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:05:37Z","timestamp":1330290337000},"page":"173-187","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning restricted probabilistic link grammars"],"prefix":"10.1007","author":[{"given":"Eva Wai-man","family":"Fong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dekai","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"13_CR1","unstructured":"Baker, James K. 1979. Trainable grammars for speech recognition. In Speech Communication Papers for the 97th Meeting of the Acoustic Society of America, ed. by D. H. Klatt & J. J. Wolf, 547\u2013550."},{"issue":"1","key":"13_CR2","first-page":"1","volume":"3","author":"Leonard E. E. Baum","year":"1972","unstructured":"Baum, Leonard E. 1972. An inequality and associated maximization technique in Statistical estimation for probabilistic functions of Markov processes. Inequalities, 3(1):1\u20138.","journal-title":"Inequalities"},{"issue":"1","key":"13_CR3","first-page":"31","volume":"18","author":"Peter F. F. Brown","year":"1992","unstructured":"Brown, Peter F., Stephen A. Della Pietra, Vincent J. Della Pietra, Jennifer C. Lai, & Robert L. Mercer. 1992. An estimate of an upper bound for the entropy of English. Computational Linguistics, 18(1):31\u201340.","journal-title":"Computational Linguistics"},{"key":"13_CR4","unstructured":"Carroll, Glenn & Eugene Charniak. 1992. Learning probabilistic dependency grammars from labelled text. In AAAI Fall Symposium on Probabilistic Approaches to Natural Language, 25\u201332, Cambridge, MA. Proceedings to appear as AAAI technical report."},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A. P. Dempster","year":"1977","unstructured":"Dempster, A. P., N. M. Laird, & D. B. Rubin. 1977. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society B, 39:1\u201338.","journal-title":"Journal of the Royal Statistical Society B"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Jelinek, Frederick, John D. Lafferty, & Robert L. Mercer. 1992. Basic methods of probabilistic context-free grammars. In Speech Recognition and Understanding: Recent Advances, Trends, and Applications, Nato ASI Series, Vol. F75, 345\u2013360. Springer Verlag.","DOI":"10.1007\/978-3-642-76626-8_35"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Lafferty, John D., Daniel Sleator, & Davy Temperley. 1992. Grammatical trigrams: A probabilistic model of link grammar. In AAAI Fall Symposium on Probabilistic Approaches to Natural Language, 89\u201397, Cambridge, MA. Proceedings to appear as AAAI technical report.","DOI":"10.21236\/ADA256365"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0885-2308(90)90022-X","volume":"4","author":"K. Lari","year":"1990","unstructured":"Lari, K. & S. J. Young. 1990. The estimation of stochastic context-free grammars using the inside-outside algorithm. Computer Speech and Language, 4:35\u201356.","journal-title":"Computer Speech and Language"},{"key":"13_CR9","unstructured":"Sleator, Daniel & Davy Temperley. 1991. Parsing English with a link grammar. Technical Report CMU-CS-91-196, Dept. of Computer Science, Carnegie Mellon University."},{"key":"13_CR10","unstructured":"Starosta, Stanley. 1991. Dependency grammar and monostratal transfer. In 2nd Japan-Australia Joint Symposium on Natural Language Processing."}],"container-title":["Lecture Notes in Computer Science","Connectionist, Statistical and Symbolic Approaches to Learning for Natural Language Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60925-3_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T17:11:12Z","timestamp":1713633072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60925-3_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609254","9783540497387"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-60925-3_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"7 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}