{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:09:13Z","timestamp":1763467753482},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,8,16]],"date-time":"2006-08-16T00:00:00Z","timestamp":1155686400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2007,1]]},"DOI":"10.1007\/s10994-006-9613-8","type":"journal-article","created":{"date-parts":[[2006,9,6]],"date-time":"2006-09-06T07:52:45Z","timestamp":1157529165000},"page":"33-67","source":"Crossref","is-referenced-by-count":27,"title":["Interactive learning of node selecting tree transducer"],"prefix":"10.1007","volume":"66","author":[{"given":"Julien","family":"Carme","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00e9mi","family":"Gilleron","sequence":"additional","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","published-online":{"date-parts":[[2006,8,16]]},"reference":[{"issue":"2","key":"9613_CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D. (1987). Learning regular sets from queries and counterexamples. Information and Computation, 75(2), 87\u2013106.","journal-title":"Information and Computation"},{"key":"9613_CR2","unstructured":"Baumgartner, R., Flesca, S., & Gottlob, G. (2001). Visual web information extraction with lixto. In 28th International Conference on Very Large Data Bases, pp. 119\u2013128."},{"key":"9613_CR3","unstructured":"Br\u00fcggemann-Klein, A., Wood, D., & Murata, M. (2001). Regular tree and regular hedge languages over unranked alphabets: Version 1."},{"key":"9613_CR4","unstructured":"Carme, J., Gilleron, R., Lemay, A., & Niehren, J. (2005). Interactive learning of node selecting tree transducer. In IJCAI Workshop on Grammatical Inference."},{"key":"9613_CR5","doi-asserted-by":"crossref","unstructured":"Carme, J., Lemay, A., & Niehren, J. (2004a). Learning node selecting tree transducer from completely annotated examples. In 7th International Colloquium on Grammatical Inference, Vol. 3264 of Lecture Notes in Artificial Intelligence, (pp. 91\u2013102). Springer Verlag.","DOI":"10.1007\/978-3-540-30195-0_9"},{"key":"9613_CR6","doi-asserted-by":"crossref","unstructured":"Carme, J., Niehren, J., & Tommasi, M. (2004b). Querying unranked trees with stepwise tree automata. In 19th International Conference on Rewriting Techniques and Applications, Vol. 3091 of Lecture Notes in Computer Science, (pp. 105\u2013118). Springer Verlag.","DOI":"10.1007\/978-3-540-25979-4_8"},{"key":"9613_CR7","unstructured":"Chidlovskii, B. (2001). Wrapping web information providers by transducer induction. In Proc. European Conference on Machine Learning, Vol. 2167 of Lecture Notes in Artificial Intelligence, pp. 61\u201373."},{"key":"9613_CR8","unstructured":"Cohen, W., Hurst, M., & Jensen, L. (2003). Web document analysis: challenges and opportunities, chap. A Flexible Learning System for Wrapping Tables and Lists in HTML Documents. World Scientific."},{"key":"9613_CR9","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., & Tommasi, M. (1997). Tree automata techniques and applications. Available on: http:\/\/www.grappa.univ-lille3.fr\/tata ."},{"key":"9613_CR10","doi-asserted-by":"crossref","unstructured":"Cristau, J., L\u00f6ding, C., & Thomas, W. (2005). Deterministic automata on unranked trees. In 15th International Symposium on Fundamentals of Computation Theory. To Appear.","DOI":"10.1007\/11537311_7"},{"key":"9613_CR11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1023\/A:1007353007695","volume":"27","author":"C. de la Higuera","year":"1997","unstructured":"de la Higuera, C. (1997). Characteristic sets for polynomial grammatical inference. Machine Learning, 27, 125\u2013137.","journal-title":"Machine Learning"},{"key":"9613_CR12","doi-asserted-by":"crossref","unstructured":"Drewes, F., & Hogberg, J. (2003). Learning a regular tree language from a teacher. In D.L.T. 2003, Vol. 2710 of Lecture Notes in Computer Science, (pp. 279\u2013291).","DOI":"10.1007\/3-540-45007-6_22"},{"key":"9613_CR13","unstructured":"Freitag, D., & Kushmerick, N. (2000). Boosted wrapper induction. In AAAI\/IAAI, (pp. 577\u2013583)."},{"key":"9613_CR14","unstructured":"Freitag, D., & McCallum, A. K. (1999). Information extraction with hmms and shrinkage. In Proceedings of the AAAI-99 Workshop on Machine Learning for Information Extraction."},{"key":"9613_CR15","doi-asserted-by":"crossref","unstructured":"Frick, M., Grohe, M., & Koch, C. (2003). Query evaluation on compressed trees. In 18th IEEE Symposium on Logic in Computer Science, (pp. 188\u2013197).","DOI":"10.1109\/LICS.2003.1210058"},{"key":"9613_CR16","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. Gold","year":"1967","unstructured":"Gold, E. (1967). Language identification in the limit. Inform. Control, 10, 447\u2013474.","journal-title":"Inform. Control"},{"key":"9613_CR17","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"E. Gold","year":"1978","unstructured":"Gold, E. (1978). Complexity of automaton identification from given data. Inform. Control, 37, 302\u2013320.","journal-title":"Inform. Control"},{"key":"9613_CR18","doi-asserted-by":"crossref","unstructured":"Gottlob, G., & Koch, C. (2002). Monadic queries over tree-structured data. In 17th Annual IEEE Symposium on Logic in Computer Science, (pp. 189\u2013202) Copenhagen.","DOI":"10.1109\/LICS.2002.1029828"},{"issue":"8","key":"9613_CR19","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0306-4379(98)00027-1","volume":"23","author":"C.-N. Hsu","year":"1998","unstructured":"Hsu, C.-N., & Dung, M.-T. (1998). Generating finite-state transducers for semi-structured data extraction from the web. Information Systems, 23(8), 521\u2013538.","journal-title":"Information Systems"},{"key":"9613_CR20","doi-asserted-by":"crossref","unstructured":"Kermorvant, C., & de la Higuera, C. (2002). Learning language with help. In 6th International Colloquium on Grammatical Inference, Vol. 2484 of Lecture Notes in Artificial Intelligence, (pp. 161\u2013173). Springer Verlag.","DOI":"10.1007\/3-540-45790-9_13"},{"key":"9613_CR21","unstructured":"Kosala, R., Bruynooghe, M., Van den Bussche, J., & Blockeel, H. (2003). Information extraction from web documents based on local unranked tree automaton inference. In 18th International Joint Conference on Artificial Intelligence, (pp. 403\u2013408). Morgan Kaufmann."},{"key":"9613_CR22","unstructured":"Kushmerick, N. (1997). Wrapper Induction for Information Extraction. Ph.D. thesis, University of Washington."},{"issue":"1\u20132","key":"9613_CR23","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0004-3702(99)00100-9","volume":"118","author":"N. Kushmerick","year":"2000","unstructured":"Kushmerick, N. (2000). Wrapper induction: Efficiency and expressiveness. Artificial Intelligence, 118(1\u20132), 15\u201368.","journal-title":"Artificial Intelligence"},{"key":"9613_CR24","unstructured":"Kushmerick, N. (2002). Finite-state approaches to web information extraction. In Proc. 3rd Summer Convention on Information Extraction."},{"key":"9613_CR25","doi-asserted-by":"crossref","unstructured":"Lang, K. J., Pearlmutter, B. A., & Price, R. A. (1998). Results of the abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. Lecture Notes in Computer Science, 1433, 1\u201312.","DOI":"10.1007\/BFb0054059"},{"key":"9613_CR26","doi-asserted-by":"crossref","unstructured":"Lang, K. (1992). Random DFA\u2019s can be approximately learned from sparse uniform examples. In Proc. 5th Annu. Workshop on Comput. Learning Theory, (pp. 45\u201352). ACM Press, New York, NY.","DOI":"10.1145\/130385.130390"},{"key":"9613_CR27","unstructured":"Libkin, L. (2005). Logics over unranked trees: An overview. In Automata, Languages and Programming: 32nd International Colloquium, No. 3580 in Lecture Notes in Computer Science, (pp. 35\u201350). Springer Verlag."},{"key":"9613_CR28","unstructured":"Martens, W., & Niehren, J. (2006). On the minimization of XML schemas and tree automata for unranked trees. Journal of Computer and System Science. Special issue of DBPL\u201905."},{"issue":"1\/2","key":"9613_CR29","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1023\/A:1010022931168","volume":"4","author":"I. Muslea","year":"2001","unstructured":"Muslea, I., Minton, S., & Knoblock, C. A. (2001). Hierarchical wrapper induction for semistructured information sources. Autonomous Agents and Multi-Agent Systems, 4(1\/2), 93\u2013114.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"9613_CR30","doi-asserted-by":"crossref","unstructured":"Neumann, A., & Seidl, H. (1998). Locating matches of tree patterns in forests. In Foundations of Software Technology and Theoretical Computer Science, (pp. 134\u2013145).","DOI":"10.1007\/978-3-540-49382-2_12"},{"issue":"1\u20132","key":"9613_CR31","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/S0304-3975(01)00301-2","volume":"275","author":"F. Neven","year":"2002","unstructured":"Neven, F., & Schwentick, T. (2002). Query automata over finite trees. Theoretical Computer Science, 275(1\u20132), 633\u2013674.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"9613_CR32","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1145\/505241.505245","volume":"49","author":"F. Neven","year":"2002","unstructured":"Neven, F., & Van Den Bussche, J. (2002). Expressiveness of structured document query languages based on attribute grammars. Journal of the ACM, 49(1), 56\u2013100.","journal-title":"Journal of the ACM"},{"key":"9613_CR33","doi-asserted-by":"crossref","unstructured":"Niehren, J., Planque, L., Talbot, J.-M., & Tison, S. (2005). N-ary queries by tree automata. In 10th International Symposium on Database Programming Languages, Vol. 3774 of Lecture Notes in Computer Science, (pp. 217\u2013231). Springer Verlag.","DOI":"10.1007\/11601524_14"},{"key":"9613_CR34","doi-asserted-by":"crossref","unstructured":"Oncina, J., & Garc\u00eda, P. (1992). Inferring regular languages in polynomial update time. In Pattern Recognition and Image Analysis, (pp. 49\u201361).","DOI":"10.1142\/9789812797902_0004"},{"key":"9613_CR35","unstructured":"Oncina, J., & Garc\u00eda, P. (1993). Inference of recognizable tree sets. Tech. rep., Departamento de Sistemas Inform\u00e1ticos y Computaci\u00f3n, Universidad de Alicante. DSIC-II\/47\/93."},{"key":"9613_CR36","unstructured":"Raeymaekers, S., & Bruynooghe, M. (2004). Minimization of finite unranked tree automata. Manuscript."},{"key":"9613_CR37","doi-asserted-by":"crossref","unstructured":"Raeymaekers, S., Bruynooghe, M., & Van den Bussche, J. (2005). Learning (k,l)-contextual tree languages for information extraction. In Proceedings of ECML\u20192005, Vol. 3720 of Lecture Notes in Artificial Intelligence, (pp. 305\u2013316).","DOI":"10.1007\/11564096_31"},{"key":"9613_CR38","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(90)90017-C","volume":"76","author":"Y. Sakakibara","year":"1990","unstructured":"Sakakibara, Y. (1990). Learning context-free grammars from structural data in polynomial time. Theoretical Computer Science, 76, 223\u2013242.","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"9613_CR39","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/BF00263578","volume":"26","author":"H. Seidl","year":"1989","unstructured":"Seidl, H. (1989). On the finite degree of ambiguity of finite tree automata. Acta Informatica, 26(6), 527\u2013542.","journal-title":"Acta Informatica"},{"key":"9613_CR40","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0022-0000(67)80022-9","volume":"1","author":"J. W. Thatcher","year":"1967","unstructured":"Thatcher, J. W. (1967). Characterizing derivation trees of context-free grammars through a generalization of automata theory. Journal of Computer and System Science, 1, 317\u2013322.","journal-title":"Journal of Computer and System Science"},{"key":"9613_CR41","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"J. W. Thatcher","year":"1968","unstructured":"Thatcher, J. W., & Wright, J. B. (1968). Generalized finite automata with an application to a decision problem of second-order logic. Mathematical System Theory, 2, 57\u201382.","journal-title":"Mathematical System Theory"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-006-9613-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-006-9613-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-006-9613-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:40:22Z","timestamp":1559353222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-006-9613-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,16]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["9613"],"URL":"https:\/\/doi.org\/10.1007\/s10994-006-9613-8","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8,16]]}}}