ACL 2023long9 citations
A dynamic programming algorithm for span-based nested named-entity recognition in O(n2)
Abstract
Span-based nested named-entity recognition (NER) has a cubic-time complexity using avariant of the CYK algorithm. We show that by adding a supplementary structural constraint on the search space, nested NER has a quadratic-time complexity, that is the same asymptotic complexity than the non-nested case. The proposed algorithm covers a large part of three standard English benchmarks and delivers comparable experimental results.
BibTeX
@inproceedings{corro-2023-dynamic,
title = "A dynamic programming algorithm for span-based nested named-entity recognition in $O(n^2)$",
author = "Corro, Caio",
editor = "Rogers, Anna and
Boyd-Graber, Jordan and
Okazaki, Naoaki",
booktitle = "Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)",
month = jul,
year = "2023",
address = "Toronto, Canada",
publisher = "Association for Computational Linguistics",
url = "https://aclanthology.org/2023.acl-long.598/",
doi = "10.18653/v1/2023.acl-long.598",
pages = "10712--10724"
}