A lightweight computational method for monitoring lexical response convergence in LLM-based synthetic populations

List of Authors

  1. Rodrigo Alvarez ,  
  2. Mina Soroberto ,  
  3. Fernando De la Prieta ,  
  4. Mario Cartón
Article Authors & roles Authors Peer review record Peer review Metrics
Cite

Abstract

Background

LLM-based synthetic populations are increasingly used to simulate open-ended survey, interview, user-research, and group-style responses. These workflows can support early exploratory research, but they also create a methodological risk: agents configured as different participants may nevertheless converge towards similar wording, examples, or answer templates. Without an explicit monitoring step, apparent agreement can be difficult to distinguish from model-level homogenization.

Methods

We present a lightweight computational method for monitoring lexical response convergence in generated agent populations. The method uses a platform-independent response-record schema, deterministic normalization, pairwise lexical overlap, vocabulary-diversity diagnostics, data-quality counters, threshold-based inspection flags, and reproducible JSON reporting. The reference implementation is the Python package synthetic-response-metrics version 0.2.5, which supports CSV, JSON, JSONL, API, and command-line execution.

Worked examples and initial validation

We provide initial validation using controlled synthetic examples created for this article. The validation includes a data-quality example, low-, moderate-, and high-convergence scenarios, a population-size sensitivity analysis, and a high-convergence diagnostic pair. These examples show expected metric behaviour, including increasing overlap under controlled convergence, changing pair counts as population size increases, and traceability of alerts through top similar pairs. In addition, an applied example generated from a synthetic-population platform uses 10 synthetic agents and three open-ended questions to check operational portability of the same input schema.

Conclusions

The method provides a reproducible lexical baseline for observing whether generated agents are producing overly similar answers. It does not replace semantic evaluation, human baselines, or domain validation, and the default threshold is provisional. However, it offers a practical monitoring layer that can be embedded in synthetic-population studies before more expensive or domain-specific validation is available.

Plain Language Summary

Researchers are beginning to use groups of AI-generated agents to explore how different people might answer questions, react to products, or discuss possible decisions. These simulations are easier to inspect when the answers are varied. A practical problem is that different agents can sometimes give answers that sound too similar, even when they are meant to represent different viewpoints.

This article describes a simple method for checking whether generated answers are becoming too alike. The method cleans the text, compares answers to the same question, reports transparent scores, and flags potential lexical convergence when two answers overlap strongly. The examples were created specifically for this article. They compare response sets that are deliberately diverse, moderately similar, and highly similar. They also show what changes when the number of agents increases, because larger populations create more possible response pairs. A further small applied example uses fictional platform-generated synthetic data to show that the same checks can be run on a realistic export.

The method is intentionally lightweight. It does not require another AI model, embeddings, or an external service. Researchers can rerun it from CSV, JSON, or JSONL files and inspect which pair of agents caused an alert. The scores should be read as an early warning system, not as a complete judgment of whether a synthetic population is valid.

Corresponding author
Rodrigo Alvarez
0009-0004-1157-4373
Grant information

This project has received funding from theHorizon Europe Framework Programme under grant agreement No [101135927](A catalyst for EuropeaN ClOUd Services in the era of data spaces, high-performance and edge computing [NOUS]). 

Copyright
© 2026 Rodrigo Alvarez (Corresponding Author, Co-Author); Mina Soroberto (Co-Author); Fernando De la Prieta (Co-Author); Mario Cartón (Co-Author) Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

First version published
Latest version published
Revised

Amendment

This revised version responds to the peer review report on version 1. The title now specifies "lexical" response convergence, aligning it with the abstract and the scope of the method.
Two additions strengthen reproducibility. A new threshold sensitivity analysis (Table 13) re-tabulates the per-question maximum Jaccard similarity for every validation condition and reports how many questions would be flagged at thresholds of 0.30, 0.50, 0.70 and 0.90, computed from the already-deposited outputs. A new reproducibility map (Table 14) links each results table to its input file and expected output file in the archived release.
Methods now state the computational environment: Python 3.10 or later, no third-party runtime dependencies, and 17 automated tests. The normalization pipeline is documented precisely, including the cleanup pattern and the stopword list sizes (20 English, 21 Spanish, 41 combined). The input data model additionally documents the loader for interaction-style exports.
Data availability now enumerates the complete manifest of the 28 deposited files with their paths inside the archive, states that inputs and expected outputs are both deposited, and explains why the data and the software share a single record.
Limitations have been strengthened. The article now states explicitly that the method cannot detect semantic convergence, distinguishes dispersion of outputs from fidelity of agent conditioning, and acknowledges that the method is platform-independent but not export-independent. Agent-conditioning fidelity is added to the planned extensions (Table 16). The Conclusions separate what the examples demonstrate from what they do not.
The Acknowledgements now carry the required funding statements for the NOUS (101135927) and MADSYNTHESIS AI (TSI-100130-2024-0134) projects.
Former Tables 13 and 14 are renumbered 15 and 16. No reported result changed.

Comments

Authors & roles

Rodrigo Alvarez

Research Group, University of Salamanca (PIC 999846610),Edificio Multiusos I+D+i, Calle Espejo s/n, Salamanca, 37007, Spain

Roles
Corresponding Author, Co-Author, Conceptualization, Formal Analysis, Methodology, Software, Validation, Writing – Original Draft Preparation, Writing – Review & Editing
0009-0004-1157-4373

Mina Soroberto

Research Group, University of Salamanca (PIC 999846610),Edificio Multiusos I+D+i, Calle Espejo s/n, Salamanca, 37007, Spain

Roles
Co-Author, Conceptualization, Formal Analysis, Methodology, Software, Supervision, Validation, Writing – Original Draft Preparation, Writing – Review & Editing
0009-0009-0349-3641

Fernando De la Prieta

Research Group, University of Salamanca (PIC 999846610),Edificio Multiusos I+D+i, Calle Espejo s/n, Salamanca, 37007, Spain

Roles
Co-Author, Conceptualization, Funding Acquisition, Supervision, Writing – Review & Editing
0000-0002-8239-5020

Mario Cartón

MADISON MK, Edificio Madison Arena, C/ Enrique Cubero 9, Valladolid, 47014, Spain

Roles
Co-Author, Software, Supervision, Validation, Writing – Review & Editing

Downloads over the last 12 months:

Cited by

via Crossref

View citing articles