{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:06:16Z","timestamp":1725487576581},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425816"},{"type":"electronic","value":"9783540448167"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[[2001]]},"DOI":"10.1007\/3-540-44816-0_23","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:38:51Z","timestamp":1184589531000},"page":"228-237","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Using Multiattribute Prediction Suffix Graphs for Spanish Part-of-Speech Tagging"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 L.","family":"Trivi\u00f1o-Rodriguez","sequence":"first","affiliation":[]},{"given":"Rafael","family":"Morales-Bueno","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,3]]},"reference":[{"key":"23_CR1","unstructured":"E. Brill. Some advances in transformation-based part of speech tagging. In Proceedings of AAAI94, page 6, 1994."},{"key":"23_CR2","unstructured":"Eugene Charniak, Curtis Hendrickson, Neil Jacobson, and Mike Perkowitz. Equations for part-ofspeech tagging. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pages 784\u2013789, 1993."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"K.W. Church. A stochastic parts program and noun phrase parser for unrestricted text. In Proceedings of ICASSP, 1989.","DOI":"10.3115\/974235.974260"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"D. Cutting, J. Kupiec, J. Pederson, and P. Sibun. A practical part-of-speech tagger. In Proceedings of the Third Conference on Applied Natural Language Processing. ACL, 1992.","DOI":"10.3115\/974499.974523"},{"key":"23_CR5","unstructured":"W. Daelemans, J. Zavrel, P. Beck, and S. Gillis. MTB: A memory-based part-ofspeech tagger generator. In Proceedings of 4th Workshop on Very Large Corpora, Copenhagen, Denmark, 1996."},{"key":"23_CR6","volume-title":"The Computational Analysis of English","author":"R. Garside","year":"1987","unstructured":"R. Garside, G. Leech, and G. Sampson. The Computational Analysis of English. London and New York: Longman, 1987."},{"key":"23_CR7","unstructured":"Fred Jelinek. Robust part-of-speech tagging using a hidden Markov model. Technical report, IBM, 1985."},{"key":"23_CR8","first-page":"161","volume":"1","author":"A. Kempe","year":"1994","unstructured":"Andr\u00e9 Kempe. Probabilistic tagging with feature structures. In Coling-94, volume 1, pages 161\u2013165, August 1994.","journal-title":"Coling-94"},{"issue":"20","key":"23_CR9","first-page":"155","volume":"2","author":"B. Merialdo","year":"1994","unstructured":"B. Merialdo. Tagging english text with a probabilistic model. Computational Linguistics, 2(20):155\u2013171, 1994.","journal-title":"Computational Linguistics"},{"key":"23_CR10","unstructured":"L. M\u00e1rquez and H. Rodr\u00edguez. Towards learning a constraint grammar from annotated corpora using decision trees. ESPRIT BRA-7315 Acquilez II, Working Paper, 1995."},{"key":"23_CR11","first-page":"81","volume":"1","author":"J.R. Quinlan","year":"1986","unstructured":"J.R. Quinlan. Induction of decision trees. Machine Learning, (1):81\u2013106, 1986.","journal-title":"Machine Learning"},{"issue":"5","key":"23_CR12","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1109\/TIT.1983.1056741","volume":"29","author":"J. Rissanen","year":"1983","unstructured":"J. Rissanen. A universal data compression system. IEEE Trans. Inform. Theory, 29(5):656\u2013664, 1983.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"23_CR13","unstructured":"D. Ron. Automata Learning and its Applications. PhD thesis, MIT, 1996."},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1023\/A:1026490906255","volume":"25","author":"D. Ron","year":"1996","unstructured":"Dana Ron, Yoram Singer, and Naftali Tishby. The power of amnesia: Learning probabilistic automata with variable memory length. Machine Learning, (25):117\u2013149, 1996.","journal-title":"Machine Learning"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"H. Schmid. Part-of-speech tagging with neural networks. In Proceedings of 15th International Conference on Computational Linguistics, Kyoto, Japan, 1994.","DOI":"10.3115\/991886.991915"},{"key":"23_CR16","unstructured":"J.L. Trivi\u00f1o. SEAM. Sistema experto para an\u013aisis morfol\u00f3gico. Master\u2019s thesis, Universidad de M\u00e1laga, 1995."},{"key":"23_CR17","unstructured":"J.L. Trivi\u00f1o and R. Morales. A spanish POS tagger with variable memory. In IWPT 2000, Sixth International Workshop on Parsing Technologies, February 2000."},{"key":"23_CR18","unstructured":"J.L. Trivi\u00f1o and R. Morales. MPSGs (multiattribute prediction suffix graphs). Technical report, Dept. Languages and Computer Sciences. University of M\u00e1laga, 2001."},{"key":"23_CR19","first-page":"268","volume":"61","author":"A.J. Viterbi","year":"1967","unstructured":"A.J. Viterbi. Error bounds for convolutional codes and an asymptotical optimal decoding algorithm. In Proceedings of IEEE, volume 61, pages 268\u2013278, 1967.","journal-title":"Proceedings of IEEE"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"A. Voutilainen and T. J\u00e4rvinen. Specifying a shallow grammatical representation for parsing purposes. In Proceedings of the 7th meeting of the European Association for Computational Linguistics, pages 210\u2013214, 1995.","DOI":"10.3115\/976973.977003"},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"1002","DOI":"10.1109\/18.135641","volume":"38","author":"M. Weinberger","year":"1982","unstructured":"M. Weinberger, A. Lempel, and K. Ziv. A sequential algorithm for the universal coding of finite-memory sources. IEEE Trans. Inform. Theory, 38:1002\u20131014, 1982.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Data Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44816-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T19:32:23Z","timestamp":1558467143000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44816-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425816","9783540448167"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-44816-0_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"3 September 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}