Logik-Sem., 26.07.06, J. Niehren
Uwe Waldmann
Einladung zum Vortrag
Zeit: Mittwoch, 26.07.06, 14.15 Uhr
Ort: Hörsaal 024, MPI Saarbrücken (Geb. E1.4)
Joachim Niehren (INRIA Futurs, LIFL, Lille, France):
Learning n-ary Queries in Trees for Web Information Extraction
Zusammenfassung:
In the first part, we discuss the W3C standard query language
XPath 2.0 for completeness with respect to first-order logic.
We continue with regular n-ary queries definable by monadic
second-order logic or tree automata.
In the second part, we present algorithms for learning n-ary node
selection queries in trees from completely annotated examples.
We assumes that queries are represented by deterministic tree
automata. We show that polynomially bounded n-ary queries in trees
can be learned from completely annotated examples, with respect
to Gold's learning model from polynomial time and data.
In the third part, we illustrate an application to Web information
extraction. We demo the Squirrel system that learns monadic
queries in HTML documents from partially annotated examples.
______________________________________________________________________
Das Logikseminar ist eine gemeinsame Veranstaltung des DFKI, des MPI
und der Fachrichtungen Informatik, Philosophie und Rechtswissenschaft.
Vortragswünsche bitte an Uwe Waldmann, MPI, Tel.: (0681) 9325-205,
uni-intern: 92205, E-Mail: u...@mpi-sb.mpg.de