A dynamic programming algorithm for span-based nested named-entity recognition in O(n 2 )

Caio Corro (1)

1 TLP - Traitement du Langage Parlé - LISN

Span-based nested named-entity recognition (NER) has a cubic-time complexity using a variant of the CYK algorithm. We show that by adding a supplementary structural constraint on the search space, nested NER has a quadratictime 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.

Domaines: Informatique et langage [cs.CL]

Caio Corro. A dynamic programming algorithm for span-based nested named-entity recognition in O(n 2 ). 61st Annual Meeting of the Association for Computational Linguistics, Jul 2023, Toronto, Canada. pp.10712-10724, ⟨10.18653/v1/2023.acl-long.598⟩. ⟨hal-04394971⟩