paper-with-me

홈 › Papers

If You Build Your Own NER Scorer, Non-replicable Results Will Come

2020-11-01 · EMNLP (insights) 2020 11 · Constantine Lignos, Marjan Kamyab

We attempt to replicate a named entity recognition (NER) model implemented in a popular toolkit and discover that a critical barrier to doing so is the inconsistent evaluation of improper label sequences. We define these sequences and examine how two scorers differ in their handling of them, finding that one approach produces F1 scores approximately 0.5 points higher on the CoNLL 2003 English development and test sets. We propose best practices to increase the replicability of NER evaluations by increasing transparency regarding the handling of improper label sequences.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

named-entity-recognitionNamed Entity RecognitionNamed Entity Recognition (NER)NER

Similar Papers 제목 키워드 기반

On the Structure of Replicable Hypothesis Testers

2025-07-03 · Anders Aamand, Maryam Aliakbarpour, Justin Y. Chen, Shyam Narayanan 외 arxiv

A hypothesis testing algorithm is replicable if, when run on two different samples from the same distribution, it produces the same output with high probability. This notion, defined by by Impagliazzo, Lei, Pitassi, and …

Personal Salience: Highlighting Is Social, but Individuality Lives in Selection

2026-06-08 · Kazuki Nakayashiki, Keisuke Watanabe arxiv

Social highlighters let people mark passages that matter to them. We ask how much of an individual is recoverable from these naturalistic traces, using a co-readership identity control (the same document highlighted by m…

Multi-Scored Sleep Databases: How to Exploit the Multiple-Labels in Automated Sleep Scoring

2022-07-05 · Luigi Fiorillo, Davide Pedroncelli, Valentina Agostini, Paolo Favaro 외

Study Objectives: Inter-scorer variability in scoring polysomnograms is a well-known problem. Most of the existing automated sleep scoring systems are trained using labels annotated by a single scorer, whose subjective e…

Computationally Efficient Replicable Learning of Parities and Applications

2026-02-10 · Moshe Noivirt, Jessica Sorrell, Eliad Tsfadia arxiv

We study the computational relationship between replicability (Impagliazzo et al. [STOC `22], Ghazi et al. [NeurIPS `21]) and other stability notions. Specifically, we focus on replicable PAC learning and its connections…

CLOVER: Closed-Loop Value Estimation and Ranking for End-to-End Autonomous Driving Planning

2026-05-14 · Sining Ang, Yuguang Yang, Canyu Chen, Yan Wang arxiv

End-to-end autonomous driving planners are commonly trained by imitating a single logged trajectory, yet evaluated by rule-based planning metrics that measure safety, feasibility, progress, and comfort. This creates a tr…

Autonomous Driving