{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:34:13Z","timestamp":1725575653691},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540236627"},{"type":"electronic","value":"9783540304692"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30469-2_6","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T22:02:17Z","timestamp":1295042537000},"page":"909-926","source":"Crossref","is-referenced-by-count":3,"title":["Taming the Unstructured: Creating Structured Content from Partially Labeled Schematic Text Sequences"],"prefix":"10.1007","author":[{"given":"Saikat","family":"Mukherjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. V.","family":"Ramakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Adelberg, B.: Nodose: A tool for semi-automatically extracting structured and semi-structured data from text documents. In: ACM Conf. on Management of Data, SIGMOD (1998)","DOI":"10.1145\/276304.276330"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Agichtein, E., Ganti, V.: Mining reference tables for automatic text segmentation. In: ACM Conf. on Knowledge Discovery and Data Mining, SIGKDD (2004)","DOI":"10.1145\/1014052.1014058"},{"key":"6_CR3","first-page":"1","volume":"3","author":"L. Baum","year":"1972","unstructured":"Baum, L.: An inequality and associated maximization technique in statistical estimation of probabilistic functions of a markov process. Inequalities\u00a03, 1\u20138 (1972)","journal-title":"Inequalities"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1007558221122","volume":"34","author":"Bikel","year":"1999","unstructured":"Bikel, Schwartz, Weischedel: An algorithm that learns what\u2019s in a name. Machine Learning\u00a034(1), 211\u2013231 (1999)","journal-title":"Machine Learning"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Borkar, V., Deshmukh, K., Sarawagi, S.: Automatic segmentation of text into structured records. In: ACM Conf. on Management of Data, SIGMOD (2001)","DOI":"10.1145\/375663.375682"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Brants, T.: Cascaded markov models. In: European Chapter of the Association for Computational Linguistics, EACL (1999)","DOI":"10.3115\/977035.977052"},{"key":"6_CR7","unstructured":"Califf, M., Mooney, R.: Relational learning of pattern-match rules for information extraction. In: National Conf. on Artificial Intelligence, AAAI (1999)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Carrasco, R., Oncina, J.: Learning stochastic regular grammars by means of a state merging method. In: Intl. Colloqium on Grammatical Inference and Applications, ICGI (1994)","DOI":"10.1007\/3-540-58473-0_144"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Cohen, W.: Fast effective rule induction. In: Intl. Conf. on Machine Learning, ICML (1995)","DOI":"10.1016\/B978-1-55860-377-6.50023-2"},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1613\/jair.587","volume":"10","author":"W. Cohen","year":"1999","unstructured":"Cohen, W., Schapire, R., Singer, Y.: Learning to order things. Journal of Artificial Intelligence Research\u00a010, 243\u2013270 (1999)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"6_CR11","unstructured":"Cohen, W., Singer, Y.: Simple, fast, and effective rule learner. In: National Conf. on Artificial Intelligence, AAAI (1999)"},{"issue":"B","key":"6_CR12","first-page":"1","volume":"39","author":"A. Dempster","year":"1977","unstructured":"Dempster, A., Laird, N., Rubin, D.: Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society\u00a039(B), 1\u201338 (1977)","journal-title":"Journal of the Royal Statistical Society"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/A:1007469218079","volume":"32","author":"S. Fine","year":"1998","unstructured":"Fine, S., Singer, Y., Tishby, N.: The hierarchical hidden markov model: Analysis and applications. Machine Learning\u00a032, 41\u201362 (1998)","journal-title":"Machine Learning"},{"key":"6_CR14","unstructured":"Freitag, D., McCallum, A.: Information extrcation using hmms and shrinkage. In: AAAI 1999 Workshop on Machine Learning for Information Extraction, pp. 31\u201336 (1999)"},{"key":"6_CR15","unstructured":"Freitag, D., McCallum, A.: Information extraction with hmm structures learned by stochastic optimization. In: National Conf. on Artificial Intelligence, AAAI (2000)"},{"key":"6_CR16","unstructured":"Lafferty, J., McCallum, A., Pereira, F.: Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In: Intl. Conf. on Machine Learning, ICML (2001)"},{"key":"6_CR17","unstructured":"Leek, T.: Information extraction using hidden markov models. In: Master\u2019s thesis UC San Diego (1997)"},{"key":"6_CR18","unstructured":"McCallum, A., Freitag, D., Pereira, F.: Maximum entropy markov models for information extraction and segmentation. In: Intl. Conf. on Machine Learning, ICML (2000)"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Rabiner, L.: A tutorial on hidden markov models and selected applications in speech recognition. Proceedings of IEEE\u00a077(2) (1989)","DOI":"10.1109\/5.18626"},{"key":"6_CR20","unstructured":"Scheffer, T., Wrobel, S.: Active learning of partially hidden markov models. In: ECML\/PKDD Workshop on Instance Selection (2001)"},{"key":"6_CR21","unstructured":"Skounakis, M., Craven, M., Ray, S.: Hierarchical hidden markov models for information extraction. In: Intl. Joint Conf. on Artificial Intelligence, IJCAI (2003)"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Soderland, S.: Learning information extraction rules for semi-structured and free text. Machine Learning\u00a034(1-3) (1999)","DOI":"10.1023\/A:1007562322031"},{"key":"6_CR23","unstructured":"Stolcke, A., Omohundro, S.: Hidden markov model induction by bayesian model merging. In: Advances in Neural Information Processing Systems, NIPS (1992)"},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/TIT.1967.1054010","volume":"13","author":"A. Viterbi","year":"1967","unstructured":"Viterbi, A.: Error bounds for convolutional codes and an asymtotically optimum decoding algorithm. IEEE Transactions on Information Theory\u00a013, 260\u2013267 (1967)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","On the Move to Meaningful Internet Systems 2004: CoopIS, DOA, and ODBASE"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30469-2_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:53:12Z","timestamp":1605761592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30469-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540236627","9783540304692"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30469-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}