Visual web information extraction with lixto, The VLDB Journal, pp.119-128, 2001. ,
Learning regular node queries in trees from completely annotated examples. Forthcoming, 2004. ,
Querying Unranked Trees with Stepwise Tree Automata, Intenational Conf. on Rewriting Techniques and Applications, 2004. ,
DOI : 10.1007/978-3-540-25979-4_8
URL : https://hal.archives-ouvertes.fr/inria-00536529
Wrapping Web Information Providers by Transducer Induction, Proc. ECML, volume 2167 of LNAI, pp.61-73, 2001. ,
DOI : 10.1007/3-540-44795-4_6
A flexible learning system for wrapping tables and lists in HTML documents, Proceedings of the eleventh international conference on World Wide Web , WWW '02, 2003. ,
DOI : 10.1145/511446.511477
Efficient Ambiguity Detection in C-NFA, Grammatical Inference: Algorithms and Applications, LNAI 1891, 2000. ,
DOI : 10.1007/978-3-540-45257-7_3
Characteristic sets for polynomial grammatical inference, Machine Learning, pp.125-137, 1997. ,
Query evaluation on compressed trees, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., 2003. ,
DOI : 10.1109/LICS.2003.1210058
Language identification in the limit, Information and Control, vol.10, issue.5, pp.447-474, 1967. ,
DOI : 10.1016/S0019-9958(67)91165-5
Monadic queries over tree-structured data, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, 2002. ,
DOI : 10.1109/LICS.2002.1029828
Learnability and definability in trees and similar structures, STACS'02, pp.645-658, 2002. ,
Learning subsequential transducers for pattern recognition and interpretation tasks, IEEE Trans. Patt. Anal. and Mach. Intell, vol.15, pp.448-458, 1993. ,
Learning Languages with Help, 2002. ,
DOI : 10.1007/3-540-45790-9_13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.3826
Information extraction from web documents based on local unranked tree automaton inference, IJCAI-2003) ,
Wrapper Induction for Information Extraction, 1997. ,
Random DFA's can be approximately learned from sparse uniform examples, Proceedings of the fifth annual workshop on Computational learning theory , COLT '92, pp.45-52, 1992. ,
DOI : 10.1145/130385.130390
Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm, ICGI 98 ,
DOI : 10.1007/BFb0054059
Query automata over finite trees, Theoretical Computer Science, vol.275, issue.1-2, pp.633-674, 2002. ,
DOI : 10.1016/S0304-3975(01)00301-2
Inferring regular languages in polynomial update time, Pattern Recognition and Image Analysis, pp.49-61, 1992. ,
Inference of recognizable tree sets, 1993. ,
Numerical document queries, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '03, pp.155-166, 2003. ,
DOI : 10.1145/773153.773169
Learning information extraction rules for semi-structured and free text, Machine Learning, pp.233-272, 1999. ,
Generalized finite automata theory with an application to a decision problem of second-order logic, Mathematical System Theory, 1968. ,
DOI : 10.1007/BF01691346