Browse State-of-the-Art › Weakly-Supervised Named Entity Recognition
Weakly-Supervised Named Entity Recognition
5 papers with code · 0 benchmarks · 6 datasets archive 2025-07-28
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
6 datasets whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Most implemented papers archive 2025-07-28
5 shown of 5 papers with code (7 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
26 May 2021 2 repositories listed Syntology ran 0 of 20 samples · 20 unverifiedTo address this challenge, we propose a conditional hidden Markov model (CHMM), which can effectively infer true labels from multi-source noisy labels in an unsupervised way.
-
27 May 2022 1 repository listedWeakly supervised named entity recognition methods train label models to aggregate the token annotations of multiple noisy labeling functions (LFs) without seeing any manually annotated labels.
-
13 Apr 2021 1 repository listed Syntology ran 2 of 2 samples · 0 unverifiedInstead of using expensive manual annotations, researchers have proposed to train named entity recognition (NER) systems using heuristic labeling rules.
-
5 Aug 2020 1 repository listed Syntology ran 2 of 2 samples · 0 unverifiedIn the electronic health record, using clinical notes to identify entities such as disorders and their temporality (e.
-
28 Jun 2020 1 repository listed Syntology ran 0 of 6 samples · 6 unverifiedWe study the open-domain named entity recognition (NER) problem under distant supervision.
Syntology lines on 4 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections