Skip to Content
Applied SciencesApplied Sciences
  • Article
  • Open Access

12 November 2021

9 Pages

Elastic CRFs for Open-Ontology Slot Filling

,
,
,
,
and
1
Speech Processing and Machine Intelligence (SPMI) Lab, Tsinghua University, Beijing 100084, China
2
Tsinghua University-China Mobile Communications Group Co., Ltd. Joint Institute, Beijing 100084, China
3
Beijing National Research Center for Information Science and Technology, Beijing 100084, China
4
China Mobile Research Institute, Beijing 100053, China

Abstract

Slot filling is a crucial component in task-oriented dialog systems that is used to parse (user) utterances into semantic concepts called slots. An ontology is defined by the collection of slots and the values that each slot can take. The most widely used practice of treating slot filling as a sequence labeling task suffers from two main drawbacks. First, the ontology is usually pre-defined and fixed and therefore is not able to detect new labels for unseen slots. Second, the one-hot encoding of slot labels ignores the correlations between slots with similar semantics, which makes it difficult to share knowledge learned across different domains. To address these problems, we propose a new model called elastic conditional random field (eCRF), where each slot is represented by the embedding of its natural language description and modeled by a CRF layer. New slot values can be detected by eCRF whenever a language description is available for the slot. In our experiment, we show that eCRFs outperform existing models in both in-domain and cross-domain tasks, especially in predicting unseen slots and values.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.