论文标题
O（n^2）中的基于跨度嵌套的命名 - 实体识别的动态编程算法
A dynamic programming algorithm for span-based nested named-entity recognition in O(n^2)
论文作者
论文摘要
基于跨度的嵌套命名 - 实体识别（NER）具有CYK算法的变体具有立方时复杂性。我们表明，通过在搜索空间上添加补充结构约束，嵌套的NER具有二次时复杂性，与非巢状况相同的渐近复杂性。提出的算法涵盖了三个标准英语基准的很大一部分，并提供了可比的实验结果。
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.
