Demo Data from SIGIR 2026 / reviewers in the wild / expert
Arthur Amalvy
dblp:325/3866
· DBLP profile ↗
4ranked-venue papers
3as first author
4since 2021 · last 2026
0000-0003-4629-0923ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 3 first-author · 4 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
3 papers |
Information extraction and text analysis · 50% Language models and text generation · 33% Graph learning · 17% | |
| Network and information security
1 paper |
Cryptographic primitives and cryptanalysis · 100% | |
| Human-computer interaction and pervasive computing
1 paper |
Usability and user experience research · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 5 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Information extraction and text analysis
topic model |
0.9 | 1 | 2025 | Persistent Homology of Topic Networks for the Prediction of Reader Curiosity · ACL (1) 2025 |
Natural language and speech › Information extraction and text analysis
named entity recognition |
0.7 | 1 | 2023 | Learning to Rank Context for Named Entity Recognition Using a Synthetic Dataset · EMNLP 2023 |
Machine learning › Graph learning › topological data analysis
persistent homology |
0.3 | 1 | 2025 | Persistent Homology of Topic Networks for the Prediction of Reader Curiosity · ACL (1) 2025 |
Machine learning › Graph learning
topological data analysis |
0.3 | 1 | 2025 | Persistent Homology of Topic Networks for the Prediction of Reader Curiosity · ACL (1) 2025 |
Information retrieval
contextual search |
0.2 | 1 | 2023 | Learning to Rank Context for Named Entity Recognition Using a Synthetic Dataset · EMNLP 2023 |
Methods — techniques the papers use, named apart from their topics
hashing · 2.0alignment · 2.0topic modeling · 1.7persistent homology · 1.7synthetic data generation · 1.3BERT · 1.3instruction-tuned language models · 0.7instruction-tuned language model · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Overcoming Copyright Barriers in Corpus Distribution Through Non-Reversible HashingabstractWhile annotated corpora are crucial in the field of natural language processing (NLP), those containing copyrighted material are difficult to exchange among researchers.Yet, such corpora are necessary to fully represent the diversity of data found in the wild in the context of NLP tasks.We tackle this issue by proposing a method to lawfully and publicly share the annotations of copyrighted literary texts.The corpus creator shares the annotations in clear, along with a non-reversible hashed version of the source material.The corpus user must own the source material, and apply the same hash function to their own tokens, in order to match them to the shared annotations.Crucially, our method is robust to reasonable divergences in the version of the copyrighted data owned by the user.As an illustration, we present alignment experiments on different editions of novels.Our results show that our method is able to correctly align 98.7 to 99.79% of tokens depending on the novel, provided the user version is sufficiently close to the corpus creator's version.We publicly release novelshare, a Python implementation of our method. Arthur Amalvy, Vincent Labatut, Xavier Bost, Hen-Hsen Huang |
ACL (1) | 1 |
| 2025 | Persistent Homology of Topic Networks for the Prediction of Reader CuriosityabstractManuel D. S. Hopp, Vincent Labatut, Arthur Amalvy, Richard Dufour, Hannah Stone, Hayley Jach, Kou Murayama. Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2025. Manuel D. S. Hopp, Vincent Labatut, Arthur Amalvy, Richard Dufour, Hannah Stone, Hayley K. Jach, Kou Murayama |
ACL (1) | 3 |
| 2025 | The Role of Natural Language Processing Tasks in Automatic Literary Character Network ConstructionabstractThe automatic extraction of character networks from literary texts is generally carried out using natural language processing (NLP) cascading pipelines. While this approach is widespread, no study exists on the impact of low-level NLP tasks on their performance. In this article, we conduct such a study on a literary dataset, focusing on the role of named entity recognition (NER) and coreference resolution when extracting co-occurrence networks. To highlight the impact of these tasks’ performance, we start with gold-standard annotations, progressively add uniformly distributed errors, and observe their impact in terms of character network quality. We demonstrate that NER performance depends on the tested novel and strongly affects character detection. We also show that NER-detected mentions alone miss a lot of character co-occurrences, and that coreference resolution is needed to prevent this. Finally, we present comparison points with 2 methods based on large language models (LLMs), including a fully end-to-end one, and show that these models are outperformed by traditional NLP pipelines in terms of recall. Arthur Amalvy, Vincent Labatut, Richard Dufour |
COLING | 1 |
| 2023 | Learning to Rank Context for Named Entity Recognition Using a Synthetic DatasetabstractWhile recent pre-trained transformer-based models can perform named entity recognition (NER) with great accuracy, their limited range remains an issue when applied to long documents such as whole novels.To alleviate this issue, a solution is to retrieve relevant context at the document level.Unfortunately, the lack of supervision for such a task means one may have to settle for unsupervised approaches.Instead, we propose to generate a synthetic context retrieval training dataset using Alpaca, an instruction-tuned large language model (LLM).Using this dataset, we train a neural context retriever based on a BERT model that is able to find relevant context for NER.We show that our method outperforms several unsupervised retrieval baselines for the NER task on an English literary dataset composed of the first chapter of 40 books, and that it performs on par with re-rankers trained on manually annotated data, or even better. Arthur Amalvy, Vincent Labatut, Richard Dufour |
EMNLP | 1 |