arXiv Open Access 2022

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

Caio Corro

Lihat Sumber

Abstrak

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 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.

Topik & Kata Kunci

cs.CL

Penulis (1)

Caio Corro

Format Sitasi

APA MLA BibTeX

Corro, C. (2022). A dynamic programming algorithm for span-based nested named-entity recognition in O(n^2). https://arxiv.org/abs/2210.04738

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2022
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓