Marrying up Regular Expressions with Neural Networks: A Case Study for Spoken Language Understanding
Abstract
The success of many natural language processing (NLP) tasks is bound by the number and quality of annotated data, but there is often a shortage of such training data. In this paper, we ask the question: "Can we combine a neural network (NN) with regular expressions (RE) to improve supervised learning for NLP?". In answer, we develop novel methods to exploit the rich expressiveness of REs at different levels within a NN, showing that the combination significantly enhances the learning effectiveness when a small number of training examples are available. We evaluate our approach by applying it to spoken language understanding for intent detection and slot filling. Experimental results show that our approach is highly effective in exploiting the available training data, giving a clear boost to the RE-unaware NN.
Cite
@article{arxiv.1805.05588,
title = {Marrying up Regular Expressions with Neural Networks: A Case Study for Spoken Language Understanding},
author = {Bingfeng Luo and Yansong Feng and Zheng Wang and Songfang Huang and Rui Yan and Dongyan Zhao},
journal= {arXiv preprint arXiv:1805.05588},
year = {2018}
}
Comments
11 Pages, 2 Figures, Accepted by ACL 2018