{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:02:21Z","timestamp":1725566541277},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540234104"},{"type":"electronic","value":"9783540301950"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30195-0_9","type":"book-chapter","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T19:53:52Z","timestamp":1285185232000},"page":"91-102","source":"Crossref","is-referenced-by-count":10,"title":["Learning Node Selecting Tree Transducer from Completely Annotated Examples"],"prefix":"10.1007","author":[{"given":"Julien","family":"Carme","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aur\u00e9lien","family":"Lemay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Niehren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Baumgartner, R., Flesca, S., Gottlob, G.: Visual web information extraction with lixto. The VLDB Journal, 119\u2013128 (2001)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Carme, J., Lemay, A., Niehren, J., Terlutte, A.: Learning regular node queries in trees from completely annotated examples (2004) (forthcoming)","DOI":"10.1007\/978-3-540-30195-0_9"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Carme, J., Niehren, J., Tommasi, M.: Querying unranked trees with stepwise tree automata. In: Intenational Conf. on Rewriting Techniques and Applications (2004)","DOI":"10.1007\/978-3-540-25979-4_8"},{"key":"9_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-44795-4_6","volume-title":"Machine Learning: ECML 2001","author":"B. Chidlovskii","year":"2001","unstructured":"Chidlovskii, B.: Wrapping web information providers by transducer induction. In: Flach, P.A., De Raedt, L. (eds.) ECML 2001. LNCS (LNAI), vol.\u00a02167, pp. 61\u201373. Springer, Heidelberg (2001)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Cohen, W.W., Hurst, M., Jensen, L.S.: A flexible learning system for wrapping tables and lists in html documents. In: Web Document Analysis: Challenges and Opportunities, MPAI, WSP (2003)","DOI":"10.1145\/511446.511477"},{"key":"9_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-45257-7_3","volume-title":"Grammatical Inference: Algorithms and Applications","author":"F. Coste","year":"2000","unstructured":"Coste, F., Fredouille, D.: Efficient ambiguity detection in c-nfa. In: Oliveira, A.L. (ed.) ICGI 2000. LNCS (LNAI), vol.\u00a01891, pp. 25\u201338. Springer, Heidelberg (2000)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1007353007695","volume":"27","author":"C. Higuera de la","year":"1997","unstructured":"de la Higuera, C.: Characteristic sets for polynomial grammatical inference. Machine Learning\u00a027, 125\u2013137 (1997)","journal-title":"Machine Learning"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Frick, M., Grohe, M., Koch, C.: Query evaluation on compressed trees. In: Proc. LICS 2003 (2003)","DOI":"10.1109\/LICS.2003.1210058"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. Gold","year":"1967","unstructured":"Gold, E.: Language identification in the limit. Inform. Control\u00a010, 447\u2013474 (1967)","journal-title":"Inform. Control"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Koch, C.: Monadic queries over tree-structured data. In: LICS (2002)","DOI":"10.1109\/LICS.2002.1029828"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/3-540-45841-7_53","volume-title":"STACS 2002","author":"M. Gruhe","year":"2002","unstructured":"Gruhe, M., Turan, G.: Learnability and definability in trees and similar structures. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 645\u2013658. Springer, Heidelberg (2002)"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1109\/34.211465","volume":"15","author":"P. Garcia.","year":"1993","unstructured":"Garcia., P., Oncina, J., Vidal, E.: Learning subsequential transducers for pattern recognition and interpretation tasks. IEEE Trans. Patt. Anal. and Mach. Intell.\u00a015, 448\u2013458 (1993)","journal-title":"IEEE Trans. Patt. Anal. and Mach. Intell."},{"key":"9_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/3-540-45790-9_13","volume-title":"Grammatical Inference: Algorithms and Applications","author":"C. Kermorvant","year":"2002","unstructured":"Kermorvant, C., de la Higuera, C.: Learning language with help. In: Adriaans, P.W., Fernau, H., van Zaanen, M. (eds.) ICGI 2002. LNCS (LNAI), vol.\u00a02484, p. 161. Springer, Heidelberg (2002)"},{"key":"9_CR14","unstructured":"Kosala, R., Bruynooghe, M., den Bussche, J.V., Blockeel, H.: Information extraction from web documents based on local unranked tree automaton inference. In: IJCAI (2003)"},{"key":"9_CR15","unstructured":"Kushmerick, N.: Wrapper Induction for Information Extraction. PhD thesis, Univ. of Washington (1997)"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/130385.130390","volume-title":"Workshop on Comput. Learning Theory","author":"K. Lang","year":"1992","unstructured":"Lang, K.: Random DFA\u2019s can be approximately learned from sparse uniform examples. In: Workshop on Comput. Learning Theory, pp. 45\u201352. ACM Press, New York (1992)"},{"key":"9_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0054059","volume-title":"Grammatical Inference","author":"K.J. Lang","year":"1998","unstructured":"Lang, K.J., Pearlmutter, B.A., Price, R.A.: Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. In: Honavar, V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol.\u00a01433, p. 1. Springer, Heidelberg (1998)"},{"issue":"1-2","key":"9_CR18","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/S0304-3975(01)00301-2","volume":"275","author":"F. Neven","year":"2002","unstructured":"Neven, F., Schwentick, T.: Query automata over finite trees. TCS\u00a0275(1-2), 633\u2013674 (2002)","journal-title":"TCS"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Oncina, J., Garcia, P.: Inferring regular languages in polynomial update time. Pattern Recognition and Image Analysis, 49\u201361 (1992)","DOI":"10.1142\/9789812797902_0004"},{"key":"9_CR20","unstructured":"Oncina, J., Garc\u00b4\u0131a, P.: Inference of recognizable tree sets. Tech. report, Universidad de Alicante, DSIC-II\/47\/93 (1993)"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Seidl, H., Schwentick, T., Muscholl, A.: Numerical document queries. In: Proceedings of the Symposium on Principles Of Database Systems, pp. 155\u2013166 (2003)","DOI":"10.1145\/773153.773169"},{"issue":"1-3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1007562322031","volume":"34","author":"S. Soderland","year":"1999","unstructured":"Soderland, S.: Learning information extraction rules for semi-structured and free text. Machine Learning\u00a034(1-3), 233\u2013272 (1999)","journal-title":"Machine Learning"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Thatcher, J.W., Wright, J.B.: Generalized finite automata with an application to a decision problem of second-order logic. Mathematical System Theory (1968)","DOI":"10.1007\/BF01691346"}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference: Algorithms and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30195-0_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:47:06Z","timestamp":1605761226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30195-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540234104","9783540301950"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30195-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}