TY - GEN
T1 - Split-correctness in information extraction
AU - Doleschal, Johannes
AU - Kimelfeld, Benny
AU - Martens, Wim
AU - Nahshon, Yoav
AU - Neven, Frank
N1 - Publisher Copyright: © 2019 ACM.
PY - 2019/6/13
Y1 - 2019/6/13
N2 - Programs for extracting structured information from text, namely information extractors, often operate separately on document segments obtained from a generic splitting operation such as sentences, paragraphs, k-grams, HTTP requests, and so on. An automated detection of this behavior of extractors, which we refer to as split-correctness, would allow text analysis systems to devise query plans with parallel evaluation on segments for accelerating the processing of large documents. Other applications include the incremental evaluation on dynamic content, where re-evaluation of information extractors can be restricted to revised segments, and debugging, where developers of information extractors are informed about potential boundary crossing of different semantic components. We propose a new formal framework for split-correctness within the formalism of document spanners. Our preliminary analysis studies the complexity of split-correctness over regular spanners. We also discuss different variants of split-correctness, for instance, in the presence of black-box extractors with "split constraints".
AB - Programs for extracting structured information from text, namely information extractors, often operate separately on document segments obtained from a generic splitting operation such as sentences, paragraphs, k-grams, HTTP requests, and so on. An automated detection of this behavior of extractors, which we refer to as split-correctness, would allow text analysis systems to devise query plans with parallel evaluation on segments for accelerating the processing of large documents. Other applications include the incremental evaluation on dynamic content, where re-evaluation of information extractors can be restricted to revised segments, and debugging, where developers of information extractors are informed about potential boundary crossing of different semantic components. We propose a new formal framework for split-correctness within the formalism of document spanners. Our preliminary analysis studies the complexity of split-correctness over regular spanners. We also discuss different variants of split-correctness, for instance, in the presence of black-box extractors with "split constraints".
KW - Complexity
KW - Information extraction
KW - Spanners
UR - http://www.scopus.com/inward/record.url?scp=85067175776&partnerID=8YFLogxK
U2 - https://doi.org/10.1145/3294052.3319684
DO - https://doi.org/10.1145/3294052.3319684
M3 - منشور من مؤتمر
T3 - Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
SP - 149
EP - 163
BT - PODS 2019 - Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
T2 - 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. PODS 2019, held in conjunction with the 2019 ACM SIGMOD International Conference on Management of Data, SIGMOD 2019
Y2 - 1 July 2019 through 3 July 2019
ER -