2026-07-23T13:08:55Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:226 2024-03-06T11:06:15Z ddc:004 open_access

N-ary Queries by Tree Automata Niehren, Joachim Planque, Laurent Talbot, Jean-Marc Tison, Sophie Information extraction semistructured documents node selecting queries in trees 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Joachim Niehren and Laurent Planque and Jean-Marc Talbot and Sophie Tison 2005 Is Part Of Dagstuhl Seminar Proceedings, Volume 5061, Foundations of Semistructured Data (2005) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.05061.5 urn:nbn:de:0030-drops-2263 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05061.5 eng https://creativecommons.org/licenses/by/4.0/legalcode