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

10/10/2022
by   Caio Corro, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset