arXiv:2109.04500

Semantic Parsing in Task-Oriented Dialog with Recursive Insertion-based Encoder

Elman Mansimov, Yi Zhang

제출 2021-09-09

원문 초록

We introduce a Recursive INsertion-based Encoder (RINE), a novel approach for semantic parsing in task-oriented dialog. Our model consists of an encoder network that incrementally builds the semantic parse tree by predicting the non-terminal label and its positions in the linearized tree. At the generation time, the model constructs the semantic parse tree by recursively inserting the predicted non-terminal labels at the predicted positions until termination. RINE achieves state-of-the-art exact match accuracy on low- and high-resource versions of the conversational semantic parsing benchmark TOP (Gupta et al., 2018; Chen et al., 2020), outperforming strong sequence-to-sequence models and transition-based parsers. We also show that our model design is applicable to nested named entity recognition task, where it performs on par with state-of-the-art approach designed for that task. Finally, we demonstrate that our approach is 2-3.5 times faster than the sequence-to-sequence model at inference time.

함께 살펴볼 논문

공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.

arXiv:2504.16007공통 태그 Named Entity Recognition (NER), named-entity-recognition, Named Entity Recognition, Nested Named Entity Recognition공식 코드 · Papers with Code

Methods for Recognizing Nested Terms

토론

이 논문과 연결된 포럼 글이 아직 없습니다.