Built independently by an author, for readers. Read the story and support ChapterPal

keyword

middle-word prompts

Middle-word prompts are automatically generated text templates used to probe and extract relational knowledge from language models by extracting the words that appear between a subject entity and an object entity in natural language text. Based on the observation that intervening words frequently express the semantic relation connecting two entities, this mining-based method locates sentences containing known entity pairs and replaces those entities with placeholders while preserving the text between them. Serving as an alternative to manually written templates or dependency-tree parsing methods, middle-word prompts offer an automated and scalable approach to query pre-trained models, thereby helping to assess and retrieve the factual knowledge stored within their parameters more accurately.

1 item

How Can We Know What Language Models Know?

How Can We Know What Language Models Know?

Zhengbao Jiang, Frank F. Xu, Jun Araki, Graham Neubig

OrganizationsCarnegie Mellon UniversityRobert Bosch Research and Technology Center

Why you should read this

Demonstrates that manual prompts underestimate the factual knowledge stored in language models and introduces automated mining, paraphrasing, and ensembling methods to substantially improve relation extraction accuracy on the LAMA benchmark.

Recent work has presented intriguing results examining the knowledge contained in language models (LM) by having the LM fill in the blanks of prompts such as "Obama is a _ by profession". These prompts are usually manually created, and quite possibly sub-optimal; another prompt such as "Obama worked as a _" may result in more accurately predicting the correct profession. Because of this, given an inappropriate prompt, we might fail to retrieve facts that the LM does know, and thus any given prompt only provides a lower bound estimate of the knowledge contained in an LM. In this paper, we attempt to more accurately estimate the knowledge contained in LMs by automatically discovering better prompts to use in this querying process. Specifically, we 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. Extensive experiments on the LAMA benchmark for extracting relational knowledge from LMs demonstrate that our methods can improve accuracy from 31.1% to 39.6%, providing a tighter lower bound on what LMs know. We have released the code and the resulting LM Prompt And Query Archive (LPAQA) at this https URL.

Added

2026-09-24