DagSemProc.05061.5.pdf
- Filesize: 157 kB
- 15 pages
Document
N-ary Queries by Tree Automata
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 5061
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2005-08-10
Cite AsGet BibTex
Joachim Niehren, Laurent Planque, Jean-Marc Talbot, and Sophie Tison. N-ary Queries by Tree Automata. In Foundations of Semistructured Data. Dagstuhl Seminar Proceedings, Volume 5061, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
https://doi.org/10.4230/DagSemProc.05061.5
https://doi.org/10.4230/DagSemProc.05061.5
Abstract
Information extraction from semi-structured documents requires to find
n-ary queries in trees that define appropriate sets of n-tuples of
nodes. We propose new representation formalisms for
n-ary queries by tree automata that we prove to capture MSO. We then
investigate n-ary queries by unambiguous tree automata which are
relevant for query induction in multi-slot information extraction.
We show that this representation formalism captures the
class of n-ary queries that are finite unions of Cartesian closed
queries, a property we prove decidable.
Keywords
- Information extraction
- semistructured documents
- node selecting queries in trees
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads