@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",
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.",
}
<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="corro-2023-dynamic">
<titleInfo>
<title>A dynamic programming algorithm for span-based nested named-entity recognition in O(n²)</title>
</titleInfo>
<name type="personal">
<namePart type="given">Caio</namePart>
<namePart type="family">Corro</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>2023-07</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<relatedItem type="host">
<titleInfo>
<title>Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</title>
</titleInfo>
<name type="personal">
<namePart type="given">Anna</namePart>
<namePart type="family">Rogers</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Jordan</namePart>
<namePart type="family">Boyd-Graber</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Naoaki</namePart>
<namePart type="family">Okazaki</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<originInfo>
<publisher>Association for Computational Linguistics</publisher>
<place>
<placeTerm type="text">Toronto, Canada</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">conference publication</genre>
</relatedItem>
<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.</abstract>
<identifier type="citekey">corro-2023-dynamic</identifier>
<identifier type="doi">10.18653/v1/2023.acl-long.598</identifier>
<location>
<url>https://aclanthology.org/2023.acl-long.598</url>
</location>
<part>
<date>2023-07</date>
<extent unit="page">
<start>10712</start>
<end>10724</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T A dynamic programming algorithm for span-based nested named-entity recognition in O(n²)
%A Corro, Caio
%Y Rogers, Anna
%Y Boyd-Graber, Jordan
%Y Okazaki, Naoaki
%S Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
%D 2023
%8 July
%I Association for Computational Linguistics
%C Toronto, Canada
%F corro-2023-dynamic
%X 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.
%R 10.18653/v1/2023.acl-long.598
%U https://aclanthology.org/2023.acl-long.598
%U https://doi.org/10.18653/v1/2023.acl-long.598
%P 10712-10724
Markdown (Informal)
[A dynamic programming algorithm for span-based nested named-entity recognition in O(n2)](https://aclanthology.org/2023.acl-long.598) (Corro, ACL 2023)
ACL