English
Related papers

Related papers: Joining Extractions of Regular Expressions

200 papers

Quotation extraction aims to extract quotations from written text. There are three components in a quotation: source refers to the holder of the quotation, cue is the trigger word(s), and content is the main body. Existing solutions for…

Computation and Language · Computer Science 2022-09-21 Yequan Wang , Xiang Li , Aixin Sun , Xuying Meng , Huaming Liao , Jiafeng Guo

Relation extraction (RE) is the task of extracting relations between entities in text. Most RE methods extract relations from free-form running text and leave out other rich data sources, such as tables. We explore RE from the perspective…

Computation and Language · Computer Science 2023-07-13 Arif Shahriar , Rohan Saha , Denilson Barbosa

Existing datasets for regular expression (regex) generation from natural language are limited in complexity; compared to regex tasks that users post on StackOverflow, the regexes in these datasets are simple, and the language used to…

Computation and Language · Computer Science 2020-05-05 Xi Ye , Qiaochu Chen , Isil Dillig , Greg Durrett

The reading comprehension task, that asks questions about a given evidence document, is a central problem in natural language understanding. Recent formulations of this task have typically focused on answer selection from a set of…

Computation and Language · Computer Science 2017-03-21 Kenton Lee , Shimi Salant , Tom Kwiatkowski , Ankur Parikh , Dipanjan Das , Jonathan Berant

Regular path queries (RPQs) the ubiquitous mechanism for querying data graphs of partially known structure. RPQs are in essence regular expressions over the edge symbols. The answer to an RPQ on a given graph (database) is the set of pairs…

Formal Languages and Automata Theory · Computer Science 2020-02-04 Gosta Grahne , Alex Thomo

Conjunctive query (CQ) evaluation is NP-complete, but becomes tractable for fragments of bounded hypertreewidth. Approximating a hard CQ by a query from such a fragment can thus allow for an efficient approximate evaluation. While…

Databases · Computer Science 2019-04-02 Pablo Barceló , Miguel Romero , Thomas Zeume

We examine the capabilities of a unified, multi-task framework for three information extraction tasks: named entity recognition, relation extraction, and event extraction. Our framework (called DyGIE++) accomplishes all tasks by…

Computation and Language · Computer Science 2019-09-11 David Wadden , Ulme Wennberg , Yi Luan , Hannaneh Hajishirzi

Relation extraction is the task of identifying predefined relationship between entities, and plays an essential role in information extraction, knowledge base construction, question answering and so on. Most existing relation extractors…

Computation and Language · Computer Science 2018-11-12 Liwei Chen , Yansong Feng , Songfang Huang , Bingfeng Luo , Dongyan Zhao

Researchers produce thousands of scholarly documents containing valuable technical knowledge. The community faces the laborious task of reading these documents to identify, extract, and synthesize information. To automate information…

Computation and Language · Computer Science 2023-12-13 Tavish McDonald , Brian Tsan , Amar Saini , Juanita Ordonez , Luis Gutierrez , Phan Nguyen , Blake Mason , Brenda Ng

Joint extraction of entities and relations from unstructured texts is a crucial task in information extraction. Recent methods achieve considerable performance but still suffer from some inherent limitations, such as redundancy of relation…

Computation and Language · Computer Science 2021-06-21 Hengyi Zheng , Rui Wen , Xi Chen , Yifan Yang , Yunyan Zhang , Ziheng Zhang , Ningyu Zhang , Bin Qin , Ming Xu , Yefeng Zheng

We present a theoretical framework for the extraction and transformation of text documents. We propose to use a two-phase process where the first phase extracts span-tuples from a document, and the second phase maps the content of the…

Databases · Computer Science 2024-05-22 Cristian Riveros , Markus L. Schmid , Nicole Schweikardt

Frequent sequence mining methods often make use of constraints to control which subsequences should be mined. A variety of such subsequence constraints has been studied in the literature, including length, gap, span, regular-expression, and…

Databases · Computer Science 2016-10-14 Kaustubh Beedkar , Rainer Gemulla

The resilience problem for a query and an input set or bag database is to compute the minimum number of facts to remove from the database to make the query false. In this paper, we study how to compute the resilience of Regular Path Queries…

Databases · Computer Science 2025-12-08 Antoine Amarilli , Wolfgang Gatterbauer , Neha Makhija , Mikaël Monet , Martín Muñoz

Query evaluation over probabilistic databases is known to be intractable in many cases, even in data complexity, i.e., when the query is fixed. Although some restrictions of the queries [19] and instances [4] have been proposed to lower the…

Databases · Computer Science 2019-08-28 Antoine Amarilli , Mikaël Monet , Pierre Senellart

Solving math word problems requires deductive reasoning over the quantities in the text. Various recent research efforts mostly relied on sequence-to-sequence or sequence-to-tree models to generate mathematical expressions without…

Computation and Language · Computer Science 2022-09-16 Zhanming Jie , Jierui Li , Wei Lu

Despite the theoretical significance and wide practical use of regular expressions, the computational complexity of learning them has been largely unexplored. We study the computational hardness of improperly learning regular expressions in…

Machine Learning · Computer Science 2025-10-07 Idan Attias , Lev Reyzin , Nathan Srebro , Gal Vardi

Event argument extraction identifies arguments for predefined event roles in text. Existing work evaluates this task with exact match (EM), where predicted arguments must align exactly with annotated spans. While suitable for span-based…

Computation and Language · Computer Science 2025-09-11 Omar Sharif , Joseph Gatto , Madhusudan Basak , Sarah M. Preum

Chart question answering (CQA) is a task used for assessing chart comprehension, which is fundamentally different from understanding natural images. CQA requires analyzing the relationships between the textual and the visual components of a…

Computer Vision and Pattern Recognition · Computer Science 2022-07-12 Matan Levy , Rami Ben-Ari , Dani Lischinski

Relation Extraction (RE) aims to label relations between groups of marked entities in raw text. Most current RE models learn context-aware representations of the target entities that are then used to establish relation between them. This…

Computation and Language · Computer Science 2019-02-26 Gaurav Singh , Parminder Bhatia

Relation extraction is a Natural Language Processing task that aims to extract relationships from textual data. It is a critical step for information extraction. Due to its wide-scale applicability, research in relation extraction has…

Computation and Language · Computer Science 2024-11-27 Anushka Swarup , Avanti Bhandarkar , Olivia P. Dizon-Paradis , Ronald Wilson , Damon L. Woodard