Generalized Multiple Intent Conditioned Slot Filling

Harshil Shah, Arthur Wilcke, Marius Cobzarenco, Cristi Cobzarenco, Edward Challis +1 more
5/18/2023
cs.CL

No confident code implementation found for this paper.

Abstract

Natural language understanding includes the tasks of intent detection (identifying a user's objectives) and slot filling (extracting the entities relevant to those objectives). Prior slot filling methods assume that each intent type cannot occur more than once within a message, however this is often not a valid assumption for real-world settings. In this work, we generalize slot filling by removing the constraint of unique intents in a message. We cast this as a JSON generation task and approach it using a language model. We create a pre-training dataset by combining DBpedia and existing slot filling datasets that we convert for JSON generation. We also generate an in-domain dataset using GPT-3. We train T5 models for this task (with and without exemplars in the prompt) and find that both training datasets improve performance, and that the model is able to generalize to intent types not seen during training.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{shah2023generalized,
  title  = {Generalized Multiple Intent Conditioned Slot Filling},
  author = {Harshil Shah and Arthur Wilcke and Marius Cobzarenco and Cristi Cobzarenco and Edward Challis and David Barber},
  year   = {2023},
  eprint = {2305.11023},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.11023v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2305.11023.svg)](https://codeofpaper.com/paper/2305.11023)

Discussion