Rudra Murthy, Riyaz Bhat, Chulaka Gunasekara, Siva Patel, Hui Wan, Tejas Dhamecha, Danish Contractor, Marina Danilevsky
| Challenge: | Semi-structured object sequences are often represented as a sequence of key-value pairs over time . authors propose a two-part approach that takes each key independently and encodes a representation of its values over time. |
| Approach: | They propose a two-part approach that first considers each key independently and encodes a representation of its values over time. |
| Outcome: | The proposed approach outperforms existing methods on multiple prediction tasks using real-world data. |
Similar Papers
On Linearizing Structured Data in Encoder-Decoder Language Models: Insights from Text-to-SQL (2024.naacl-long)
Copied to clipboard
| Challenge: | Structured data is prevalent in tables, databases, and knowledge graphs, but there is a gap in our understanding of how these linearization-based methods handle structured data, which is inherently non-linear. |
| Approach: | They investigate the linear handling of structured data in encoder-decoder language models, specifically T5. |
| Outcome: | The proposed model can mimic human-designed processes such as schema linking and syntax prediction, and it can be compressed due to modality fusion redundancy. |
Bringing Emerging Architectures to Sequence Labeling in NLP (2026.eacl-long)
Copied to clipboard
| Challenge: | Pretrained Transformer encoders are the dominant approach to sequence labeling . however, few have been applied to sequence labels on flat or simplified tasks . |
| Approach: | They propose to use pretrained Transformer encoders to model relations across words . they find that the architectures adapt well across tagging tasks that vary in complexity . |
| Outcome: | The proposed architectures perform well across tagging tasks across languages and datasets. |
Leveraging AMR Graph Structure for Better Sequence-to-Sequence AMR Parsing (2024.lrec-main)
Copied to clipboard
| Challenge: | Recent studies on AMR parsing often regard this task as a seq2seq translation problem. |
| Approach: | They propose to translate AMR graphs into AMR token sequences in pre-processing and recover AMR from sequences after decoding. |
| Outcome: | The proposed approach outperforms baseline and achieves 85.5 0.1 and 84.2 0.2 Smatch scores on AMR 2.0 and AMR 3.0. |
FormNet: Structural Encoding beyond Sequential Modeling in Form Document Information Extraction (2022.acl-long)
Copied to clipboard
Chen-Yu Lee, Chun-Liang Li, Timothy Dozat, Vincent Perot, Guolong Su, Nan Hua, Joshua Ainslie, Renshen Wang, Yasuhisa Fujii, Tomas Pfister
| Challenge: | Form-like document understanding is a surging research topic due to its practical applications . form documents have unique challenges stemming from their structural characteristics . |
| Approach: | They propose a structure-aware sequence model that leverages spatial relationships between tokens in a form for more precise attention score calculation. |
| Outcome: | The proposed model outperforms existing methods with a more compact model size and less pre-training data. |
Improving AMR Parsing with Sequence-to-Sequence Pre-training (2020.emnlp-main)
Copied to clipboard
| Challenge: | Abstract meaning representation (AMR) parsing is limited by the size of curated datasets. |
| Approach: | They propose a seq2seq pre-training approach to build pre-trained models on three relevant tasks. |
| Outcome: | The proposed model improves performance on three relevant tasks while maintaining the response of pre-trained models. |
Disentangled Sequence to Sequence Learning for Compositional Generalization (2022.acl-long)
Copied to clipboard
| Challenge: | Existing models struggle to generalize to unseen compositions of seen components . a new approach allows for disentangled representations and better generalization . |
| Approach: | They propose an extension to sequence-to-sequence models which encourage disentanglement by re-encoding source input. |
| Outcome: | The proposed extension delivers better generalization and more disentangled representations . human expressions can be understood by combining known atomic components . |
Unleashing the True Potential of Sequence-to-Sequence Models for Sequence Tagging and Structure Parsing (2023.tacl-1)
Copied to clipboard
| Challenge: | Sequence-to-Sequence (S2S) models have been successful on text generation tasks . however, learning complex structures with S2S models remains challenging . |
| Approach: | They propose to use constrained decoding to model part-of-speech tagging, named entity recognition, constituency, and dependency parsing tasks with 3 lexically diverse linearization schemas and corresponding constrained coding methods. |
| Outcome: | The proposed methods outperform the state-of-the-art on four core tasks. |
Semi-Supervised Learning for Neural Keyphrase Generation (D18-1)
Copied to clipboard
| Challenge: | Existing models for keyphrase generation only use labeled data, which is limited to resource-rich domains. |
| Approach: | They propose semi-supervised keyphrase generation methods by leveraging labeled data and large-scale unlabeled samples for learning. |
| Outcome: | The proposed methods outperform state-of-the-art models trained with labeled data and large-scale unlabeled samples for learning. |
Hierarchical Bracketing Encodings Work for Dependency Graphs (2025.emnlp-main)
Copied to clipboard
| Challenge: | Sequence labeling (SL) is a simple yet effective paradigm for a wide range of natural language problems. |
| Approach: | They propose a new bracketing approach for dependency graph parsing that encodes graphs as sequences and n tagging actions. |
| Outcome: | The proposed approach significantly reduces label space while preserving structural information. |
Exploiting Rich Syntactic Information for Semantic Parsing with Graph-to-Sequence Model (D18-1)
Copied to clipboard
| Challenge: | Existing neural semantic parsers extract word order features while neglecting other valuable syntactic information. |
| Approach: | They propose to use syntactic graph to represent three types of syntaktic information . they then employ a graph-to-sequence model to encode the syntastic graph and decode a logical form . |
| Outcome: | The proposed model is comparable to the state-of-the-art on Jobs640, ATIS, and Geo880. |