Home ›
Entities
› academia
› An Embarrassingly Easy but Strong Baseline for Nested Named Entity Recognition
An Embarrassingly Easy but Strong Baseline for Nested Named Entity Recognition
Research article (Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers), 2023) · cited 51× · AI/ML
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA4ort.xyz Knowledge Graph. (2026). An Embarrassingly Easy but Strong Baseline for Nested Named Entity Recognition. Retrieved May 24, 2026, from https://4ort.xyz/entity/an-embarrassingly-easy-but-strong-baseline-for-nested-named-entity-recognition
MLA“An Embarrassingly Easy but Strong Baseline for Nested Named Entity Recognition.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/an-embarrassingly-easy-but-strong-baseline-for-nested-named-entity-recognition.
BibTeX@misc{4ortxyz_an-embarrassingly-easy-but-strong-baseline-for-nested-named-entity-recognition_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{An Embarrassingly Easy but Strong Baseline for Nested Named Entity Recognition}}, year = {2026}, url = {https://4ort.xyz/entity/an-embarrassingly-easy-but-strong-baseline-for-nested-named-entity-recognition}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): An Embarrassingly Easy but Strong Baseline for Nested Named Entity Recognition — https://4ort.xyz/entity/an-embarrassingly-easy-but-strong-baseline-for-nested-named-entity-recognition (retrieved 2026-05-24)