| Challenge: | Infilling is the task of predicting missing spans of text at any position in a document. |
| Approach: | They propose a framework which can be used to infill entire sentences . they train off-the-shelf LMs on sequences containing concatenation of masked text . |
| Outcome: | The proposed approach can infill entire sentences on short stories, scientific abstracts, and lyrics. |
Similar Papers
INSET: Sentence Infilling with INter-SEntential Transformer (2020.acl-main)
Copied to clipboard
| Challenge: | Missing sentence generation fosters a wide range of applications in natural language generation . Developing models for sentence infilling can potentially facilitate many text generation applications . |
| Approach: | They propose a framework to decouple the problem from natural language processing . they propose generating missing sentences that can syntactically and semantically bridge context . |
| Outcome: | The proposed model learns a sentence representation and generates 'missing sentences' the proposed model can be used for document auto-completion and meeting note expansion . |
Unsupervised Subtitle Segmentation with Masked Language Models (2023.acl-short)
Copied to clipboard
| Challenge: | Existing methods to improve subtitle segmentation are based on character counting and linguistically correct segmentation. |
| Approach: | They propose a method where subtitle breaks are predicted according to likelihood of punctuation . their approach is highly portable across languages and domains . |
| Outcome: | The proposed method obtained competitive results in terms of segmentation accuracy across metrics while also fully preserving the original text and complying with length constraints. |
How to represent a word and predict it, too: Improving tied architectures for language modelling (D18-1)
Copied to clipboard
| Challenge: | Recent state-of-the-art models use word embeddings as input and output mappings instead of tied models. |
| Approach: | They propose to decouple hidden state from word embedding prediction . they extend their proposed modification to word2vec models . |
| Outcome: | The proposed architectures achieve comparable or better results compared to previous models without tying . the proposed architecture reduces parameters, enabling more compact models and faster learning. |
Think in Sentences: Explicit Sentence Boundaries Enhance Language Model’s Capabilities (2026.acl-long)
Copied to clipboard
| Challenge: | Existing studies focus on dummy tokens but fail to leverage the inherent sentence-level structure of natural language. |
| Approach: | They propose a method that inserts delimiters at sentence boundaries to enhance large language models' capabilities. |
| Outcome: | The proposed method improves performance on 7B LLMs to 600B Deepseek-V3 with 7.7% gains on GSM8k and 12.5% on DROP. |
How Can We Know What Language Models Know? (2020.tacl-1)
Copied to clipboard
| Challenge: | Recent work examines knowledge contained in language models by having the LM fill in the blanks of prompts such as “Obama is a __ by profession”. |
| Approach: | They propose mining-based and paraphrasing-based methods to automatically generate high-quality and diverse prompts, as well as ensemble methods to combine answers from different prompts. |
| Outcome: | The proposed methods improve accuracy from 31.1% to 39.6% on the LAMA benchmark for extracting relational knowledge from LMs. |
A Survey on LLMs for Story Generation (2025.findings-emnlp)
Copied to clipboard
Maria Teleki, Vedangi Bengali, Xiangjue Dong, Sai Tejas Janjur, Haoran Liu, Tian Liu, Cong Wang, Ting Liu, Yin Zhang, Frank Shipman, James Caverlee
| Challenge: | Methods for story generation with Large Language Models (LLMs) have come into the spotlight recently. |
| Approach: | They propose a novel taxonomy of LLMs for story generation consisting of two major paradigms: independent story generation by an LLM, and author-assistance for story creation . |
| Outcome: | The proposed taxonomy compares existing work on the topic with those of novel author-assistance models. |
How Do Language Models Acquire Character-Level Information? (2026.eacl-long)
Copied to clipboard
| Challenge: | Language models (LMs) implicitly encode character-level information, despite not being explicitly provided during training. |
| Approach: | They analyze how language models acquire character-level knowledge by comparing them to standard settings. |
| Outcome: | The results show that LMs do not treat words as opaque tokens, but instead treat them as tokens. |
Why Generate When You Can Discriminate? A Novel Technique for Text Classification using Language Models (2024.findings-eacl)
Copied to clipboard
| Challenge: | Existing methods for text classification using autoregressive language models are limited . authors propose a novel technique for text classification using autoreregressives . |
| Approach: | They propose a two-step technique for text classification using autoregressive language models . they use a set of perplexity and log-likelihood based numeric features to elicit a text instance . |
| Outcome: | The proposed technique eliminates parameter updates in LMs and does not limit training examples . it is evaluated across 5 datasets and compares with multiple competent baselines . |
Blank Language Models (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches focus on adapting left-to-right language models for text infilling. |
| Approach: | They propose a model that generates sequences by dynamically creating and filling in blanks. |
| Outcome: | Experiments on style transfer and damaged ancient text restoration show that the proposed model outperforms baseline models in terms of accuracy and fluency. |
Extracting Latent Steering Vectors from Pretrained Language Models (2022.findings-acl)
Copied to clipboard
| Challenge: | Prior work on controllable text generation has focused on learning how to control language models through trainable decoding, smart-prompt design, or fine-tuning based on a desired objective. |
| Approach: | They propose to extract latent vectors directly from pretrained language model decoders without fine-tuning. |
| Outcome: | The proposed approach generates a target sentence nearly perfectly for English sentences . it outperforms pooled hidden states of models on a textual similarity benchmark . |