| Challenge: | CKY algorithm is a cubic dependence on sentence length, but transformers can be used to approximate it. |
| Approach: | They propose a transformer-based approach that approximates the CKY algorithm by directly predicting a sentence's parse and avoiding its cubic dependence on sentence length. |
| Outcome: | The proposed approach achieves better performance than comparable parsers that make use of CKY, while being faster. |
Similar Papers
Transformer Grammars: Augmenting Transformer Language Models with Syntactic Inductive Biases at Scale (2022.tacl-1)
Copied to clipboard
| Challenge: | a novel class of Transformer language models that combine expressive power, scalability, and strong performance of Transformers and recursive syntactic compositions. |
| Approach: | They introduce Transformer Grammars, a class of Transformer language models that combine expressive power and recursive syntactic compositions. |
| Outcome: | The proposed model outperforms strong baselines on sentence-level language modeling perplexity and syntax-sensitive language evaluation metrics. |
Approximate Attributions for Off-the-Shelf Siamese Transformers (2024.eacl-long)
Copied to clipboard
| Challenge: | Existing attribution methods cannot tackle Siamese encoders since they compare two inputs rather than processing a single one. |
| Approach: | They propose an attribution method specifically targeted for Siamese encoders that can be adjusted and fine-tuned to retain original model's predictive performance. |
| Outcome: | The proposed method retains the original model's predictive performance and can be applied to off-the-shelf models. |
Inference Time Style Control for Summarization (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing methods to generate summaries of different styles without training separate models are lacking parallel data and expensive (re)training. |
| Approach: | They propose two methods that can be deployed during summary decoding on any pre-trained Transformer-based summarization model. |
| Outcome: | The proposed methods generate news headlines with various ideological leanings while still informative. |
Learning to Fuse Sentences with Transformers for Summarization (2020.emnlp-main)
Copied to clipboard
| Challenge: | Abstractive summarization systems that fuse sentences are not rewarded for correctly fusing sentences. |
| Approach: | They propose to leverage the knowledge of points of correspondence between sentences to enhance their ability to fuse sentences. |
| Outcome: | The proposed algorithms improve the ability of the proposed summarization systems to fuse sentences and show that they can fuse sentences in a way that retains the original meaning. |
Can Transformers Learn n-gram Language Models? (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing work has tested transformers' ability to represent formal languages, but language models are not classifiers of strings but rather distributions over them. |
| Approach: | They relate transformers' ability to learn random n-gram language models to ngram language model (LM) they find add- smoothing outperforms transformers on the former, while transformers perform better on the latter . |
| Outcome: | The proposed models outperform classical methods designed to learn n-gram LMs, while transformers perform better on the latter. |
Choose Your Transformer: Improved Transferability Estimation of Transformer Models on Classification Tasks (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing models for NLP tasks require fine-tuning, but it is computationally infeasible. |
| Approach: | They propose an approach that inexpensively estimates a ranking of the expected performance of a given set of transformer language models for a specific task. |
| Outcome: | The proposed model improves the Pearson correlation coefficient between the true model ranks and the estimate. |
Reservoir Transformers (2021.acl-long)
Copied to clipboard
| Challenge: | Using random initialization, we show that some transformers obtain impressive performance even when some of the layers are frozen. |
| Approach: | They propose to freeze transformer layers and use them to improve performance . they find that the transformers obtain impressive performance even when some of the layers are randomly initialized and never updated. |
| Outcome: | The proposed model improves on translation and language modelling tasks even when some layers are frozen. |
Do Transformers Parse while Predicting the Masked Word? (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies show that pre-trained language models encode linguistic structures like parse trees while being trained unsupervised. |
| Approach: | They propose to train pre-trained language models to encode linguistic structures like parse trees while unsupervised. |
| Outcome: | The proposed model performs optimally for masked language modeling loss on the English PCFG. |
Do Transformer Modifications Transfer Across Implementations and Applications? (2021.emnlp-main)
Copied to clipboard
Sharan Narang, Hyung Won Chung, Yi Tay, Liam Fedus, Thibault Fevry, Michael Matena, Karishma Malkan, Noah Fiedel, Noam Shazeer, Zhenzhong Lan, Yanqi Zhou, Wei Li, Nan Ding, Jake Marcus, Adam Roberts, Colin Raffel
| Challenge: | Currently, the Transformer is the de facto architecture of choice for processing sequential data. |
| Approach: | They evaluate the Transformer architecture and its modifications in a shared experimental setting . they conjecture that performance improvements may strongly depend on implementation details . |
| Outcome: | The proposed improvements do not significantly improve performance, the authors find . the proposed improvements are either developed in the same codebase or are minor changes . |
Practical Parsing for Downstream Applications (C18-3)
Copied to clipboard
| Challenge: | . - (EN) |
| Approach: | . - (EN) |
| Outcome: | . - (EN) |