Augmenting Task-Oriented Dialogue Systems with Relation Extraction
Not on the map. Why?
Abstract (arXiv)
The standard task-oriented dialogue pipeline uses intent classification and slot-filling to interpret user utterances. While this approach can handle a wide range of queries, it does not extract the information needed to handle more complex queries that contain relationships between slots. We propose integration of relation extraction into this pipeline as an effective way to expand the capabilities of dialogue systems. We evaluate our approach by using an internal dataset with slot and relation annotations spanning three domains. Finally, we show how slot-filling annotation schemes can be simplified once the expressive power of relation annotations is available, reducing the number of slots while still capturing the user's intended meaning.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 15 of its 36 references that are in the map. First posted on arXiv 24 Oct 2022.
Builds on
15 of 36 references.
References · 15
- 2020A Simple Language Model for Task-Oriented Dialoguecited by 331
- 2016End-to-End Relation Extraction using LSTMs on Sequences and Tree Structurescited by 161
- 2018Improving Text-to-SQL Evaluation Methodologycited by 133
- 2020Task-Oriented Dialogue as Dataflow Synthesiscited by 122
- 2018Semantic Parsing for Task Oriented Dialog using Hierarchical Representationscited by 101
- 2020Dialogue-Based Relation Extractioncited by 68
- 2019SemEval-2010 Task 8: Multi-Way Classification of Semantic Relations Between Pairs of Nominalscited by 63
- 2019OpenNRE: An Open and Extensible Toolkit for Neural Relation Extractioncited by 62
- 2019Long-tail Relation Extraction via Knowledge Graph Embeddings and Graph Convolution Networkscited by 61
- 2020Conversational Semantic Parsing for Dialog State Trackingcited by 40
- 2020Conversational Semantic Parsingcited by 39
- 2019Improving Relation Extraction by Pre-trained Language Representationscited by 24
Built on by
Citing papers per year: 2023: 1.
1 paper.