TIE: Topological Information Enhanced Structural Reading Comprehension on Web Pages (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing models for structural reading comprehension (SRC) only focus on comprehension of plain text, tables, tables or knowledge bases. |
| Approach: | They propose a topological information enhanced model which transforms a token-level task into a tag-level one by introducing a two-stage process. |
| Outcome: | The proposed model outperforms baselines and achieves state-of-the-art performance on the web-based SRC benchmark WebSRC at the time of writing. |
Similar Papers
WebSRC: A Dataset for Web-Based Structural Reading Comprehension (2021.emnlp-main)
Copied to clipboard
| Challenge: | Using a web page and a question, a machine can't understand the contents of web pages. |
| Approach: | They propose a novel dataset for web-based structural reading comprehension that consists of 400K question-answer pairs and a dataset of 6.4K web pages. |
| Outcome: | The proposed dataset consists of 400K question-answer pairs, collected from 6.4K web pages with corresponding HTML source code, screenshots, and metadata. |
Dependency Parsing as MRC-based Span-Span Prediction (2022.acl-long)
Copied to clipboard
| Challenge: | Existing methods for dependency parsing address the issue that edges should be constructed at the text span/subtree level rather than word level. |
| Approach: | They propose a method that constructs dependency trees by directly modeling span-span relations by modeling subtree-subtree relationships. |
| Outcome: | The proposed method constructs dependency trees by modeling span-span relations . it can retrieve missing spans in the span proposal stage, which leads to higher recall . |
Document Modeling with Graph Attention Networks for Multi-grained Machine Reading Comprehension (2020.acl-main)
Copied to clipboard
| Challenge: | Existing approaches to machine reading comprehension treat documents at their hierarchical nature, ignoring their dependencies. |
| Approach: | They propose a machine reading comprehension benchmark with two-grained answers . they use graph attention networks to model documents at their hierarchical nature . |
| Outcome: | The proposed framework outperforms existing systems at long and short answer criteria. |
Bridging Local Details and Global Context in Text-Attributed Graphs (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies focus on combining different information levels but overlook interconnections, i.e., contextual textual information among nodes. |
| Approach: | They propose a framework that bridges local and global perspectives by leveraging contextual textual information. |
| Outcome: | The proposed framework achieves state-of-the-art performance while reducing tokens significantly. |
DRTS Parsing with Structure-Aware Encoding and Decoding (2020.acl-main)
Copied to clipboard
| Challenge: | Discourse representation tree structure (DRTS) parsing is a new semantic parser which ignores structural information. |
| Approach: | They propose a structural-aware model to integrate structural information into the model . they use graph attention network (GAT) to exploit structural information for effective modeling . |
| Outcome: | The proposed model can achieve the best performance on a benchmark dataset. |
Cut to the Chase: A Context Zoom-in Network for Reading Comprehension (D18-1)
Copied to clipboard
| Challenge: | Recent deep-learning based models suffer from reasoning over long documents and do not trivially generalize to cases where the answer is not present as a span. |
| Approach: | They propose a novel context zoom-in network (ConZNet) that can skip through irrelevant parts of a document and generate an answer using only the relevant regions of text. |
| Outcome: | The proposed architecture outperforms state-of-the-art results by 12.62% (ROUGE-L) relative improvement on the recently proposed and challenging RC dataset ‘NarrativeQA’. |
Does Structure Matter? Encoding Documents for Machine Reading Comprehension (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing Transformer-based models for machine reading comprehension treat documents as flat sequences. |
| Approach: | They propose a Transformer-based method that reads a document as tree slices and jointly trains and consults the modules at inference time. |
| Outcome: | The proposed method outperforms several baseline approaches on two datasets from varied domains. |
Token-level Dynamic Self-Attention Network for Multi-Passage Reading Comprehension (P19-1)
Copied to clipboard
| Challenge: | Multi-passage reading comprehension requires the ability to combine cross-passages information and reason over multiple passages to infer the answer. |
| Approach: | They propose a Dynamic Self-attention Network (DynSAN) which processes cross-passage information at token-level and meanwhile avoids substantial computational costs. |
| Outcome: | The proposed model achieves state-of-the-art performance on the SearchQA, Quasar-T and WikiHop datasets and further ablation validates the effectiveness of its components. |
Machine Reading Comprehension Using Structural Knowledge Graph-aware Network (D19-1)
Copied to clipboard
| Challenge: | Recent large-scale datasets specify that external knowledge is required to answer questions. |
| Approach: | They propose a model that leverages external knowledge to construct sub-graphs for entities in machine comprehension context. |
| Outcome: | The proposed model achieves state-of-the-art performance on the ReCoRD dataset. |
Improving Span Representation by Efficient Span-Level Attention (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for generating high-quality span representations are limited by subset of tokens . span-span interactions should play an important role in span encoding, authors argue . |
| Approach: | They propose to introduce span-span interactions and more comprehensive span-token interactions to improve span representations. |
| Outcome: | The proposed model outperforms baseline models on span-related tasks and shows superior performance. |