English
Related papers

Related papers: Learning Open Information Extraction of Implicit R…

200 papers

Implicit discourse relation classification is one of the most difficult steps in discourse parsing. The difficulty stems from the fact that the coherence relation must be inferred based on the content of the discourse relational arguments.…

Computation and Language · Computer Science 2019-04-03 Wei Shi , Vera Demberg

Information extraction (IE) from text has largely focused on relations between individual entities, such as who has won which award. However, some facts are never fully mentioned, and no IE method has perfect recall. Thus, it is beneficial…

Computation and Language · Computer Science 2017-05-30 Paramita Mirza , Simon Razniewski , Fariz Darari , Gerhard Weikum

This paper contributes a joint embedding model for predicting relations between a pair of entities in the scenario of relation inference. It differs from most stand-alone approaches which separately operate on either knowledge bases or free…

Computation and Language · Computer Science 2015-07-08 Miao Fan , Kai Cao , Yifan He , Ralph Grishman

Verbs form the backbone of language, providing the structure and meaning to sentences. Yet, their intricate semantic nuances pose a longstanding challenge. Understanding verb relations through the concept of lexical entailment is crucial…

Computation and Language · Computer Science 2024-11-08 Candida M. Greco , Lucio La Cava , Andrea Tagarelli

Reconciling the tension between inductive learning and deductive reasoning in first-order relational domains is a longstanding challenge in AI. We study the problem of answering queries in a first-order relational probabilistic logic…

Artificial Intelligence · Computer Science 2026-02-17 Luise Ge , Brendan Juba , Kris Nilsson , Alison Shao

While traditional systems for Open Information Extraction were statistical and rule-based, recently neural models have been introduced for the task. Our work builds upon CopyAttention, a sequence generation OpenIE model (Cui et. al., 2018).…

Computation and Language · Computer Science 2020-05-19 Keshav Kolluru , Samarth Aggarwal , Vipul Rathore , Mausam , Soumen Chakrabarti

Large Language Models (LLMs) have demonstrated their remarkable capabilities in document understanding. However, recent research reveals that LLMs still exhibit performance gaps in Document-level Relation Extraction (DocRE) as requiring…

Computation and Language · Computer Science 2025-11-12 Qiankun Pi , Yepeng Sun , Jicang Lu , Qinlong Fan , Ningbo Huang , Shiyu Wang

Natural language inference (NLI) is an increasingly important task for natural language understanding, which requires one to infer whether a sentence entails another. However, the ability of NLI models to make pragmatic inferences remains…

Computation and Language · Computer Science 2020-07-15 Paloma Jeretic , Alex Warstadt , Suvrat Bhooshan , Adina Williams

Human-like large language models (LLMs), especially the most powerful and popular ones in OpenAI's GPT family, have proven to be very helpful for many natural language processing (NLP) related tasks. Therefore, various attempts have been…

Computation and Language · Computer Science 2024-09-11 Ridong Han , Chaohao Yang , Tao Peng , Prayag Tiwari , Xiang Wan , Lu Liu , Benyou Wang

Human-like large language models (LLMs), especially the most powerful and popular ones in OpenAI's GPT family, have proven to be very helpful for many natural language processing (NLP) related tasks. Therefore, various attempts have been…

Computation and Language · Computer Science 2024-09-12 Ridong Han , Chaohao Yang , Tao Peng , Prayag Tiwari , Xiang Wan , Lu Liu , Benyou Wang

We revisit the challenging problem of resolving prepositional-phrase (PP) attachment ambiguity. To date, proposed solutions are either rule-based, where explicit grammar rules direct how to resolve ambiguities; or statistical, where the…

Computation and Language · Computer Science 2021-02-08 Yida Xin , Henry Lieberman , Peter Chin

Relation Extraction is an important sub-task of Information Extraction which has the potential of employing deep learning (DL) models with the creation of large datasets using distant supervision. In this review, we compare the…

Computation and Language · Computer Science 2017-05-11 Shantanu Kumar

We consider an unanswered question in the discourse processing community: why do relation classifiers trained on explicit examples (with connectives removed) perform poorly in real implicit scenarios? Prior work claimed this is due to…

Computation and Language · Computer Science 2024-04-02 Wei Liu , Stephen Wan , Michael Strube

Large Language Models (LLMs) show remarkable potential for few-shot information extraction (IE), yet their performance is highly sensitive to the choice of in-context examples. Conventional selection strategies often fail to provide…

Computation and Language · Computer Science 2026-05-13 Dong Zhao , Yadong Wang , Xiang Chen , Chenxi Wang , Hongliang Dai , Chuanxing Geng , Shengzhong Zhang , Shaoyuan Li , Sheng-Jun Huang

Relational facts are an important component of human knowledge, which are hidden in vast amounts of text. In order to extract these facts from text, people have been working on relation extraction (RE) for years. From early pattern matching…

Computation and Language · Computer Science 2020-10-01 Xu Han , Tianyu Gao , Yankai Lin , Hao Peng , Yaoliang Yang , Chaojun Xiao , Zhiyuan Liu , Peng Li , Maosong Sun , Jie Zhou

In document-level relation extraction, entities may appear multiple times in a document, and their relationships can shift from one context to another. Accurate prediction of the relationship between two entities across an entire document…

Computation and Language · Computer Science 2025-08-01 Nilesh , Atul Gupta , Avinash C Panday

Weakly-supervised Phrase Grounding (WPG) is an emerging task of inferring the fine-grained phrase-region matching, while merely leveraging the coarse-grained sentence-image pairs for training. However, existing studies on WPG largely ignore…

Computation and Language · Computer Science 2024-03-05 Jiamin Luo , Jianing Zhao , Jingjing Wang , Guodong Zhou

Document-level relation extraction has attracted much attention in recent years. It is usually formulated as a classification problem that predicts relations for all entity pairs in the document. However, previous works indiscriminately…

Computation and Language · Computer Science 2021-06-04 Shuang Zeng , Yuting Wu , Baobao Chang

We introduce a new open information extraction (OIE) benchmark for pre-trained language models (LM). Recent studies have demonstrated that pre-trained LMs, such as BERT and GPT, may store linguistic and relational knowledge. In particular,…

Computation and Language · Computer Science 2022-10-26 Chenguang Wang , Xiao Liu , Dawn Song

Discourse relations bind smaller linguistic elements into coherent texts. However, automatically identifying discourse relations is difficult, because it requires understanding the semantics of the linked sentences. A more subtle challenge…

Computation and Language · Computer Science 2015-04-29 Yangfeng Ji , Jacob Eisenstein