Weakly Supervised Slot Tagging with Partially Labeled Sequences from Web Search Click Logs

23695

Authors

nan

Abstract

In this paper, we apply a weakly-supervised learning approach for slot tagging using con- ditional random fields by exploiting web search click logs. We extend the constrained lattice training of T¨ackstr¨om et al. (2013) to non-linear conditional random fields in which latent variables mediate between observations and labels. When combined with a novel initialization scheme that leverages unlabeled data, we show that our method gives signifi- cant improvement over strong supervised and weakly-supervised baselines. 1

Keywords

nan

Full Content

Human Language Technologies: The 2015 Annual Conference of the North American Chapter of the ACL, pages 84–92, Denver, Colorado, May 31 – June 5, 2015. c⃝2015 Association for Computational Linguistics Weakly Supervised Slot Tagging with Partially Labeled Sequences from Web Search Click Logs Young-Bum Kim† Minwoo Jeong† Karl Stratos‡ Ruhi Sarikaya† †Microsoft Corporation, Redmond, WA ‡Columbia University, New York, NY {ybkim, minwoo.jeong, ruhi.sarikaya}@microsoft.com stratos@cs.columbia.edu Abstract In this paper, we apply a weakly-supervised learning approach for slot tagging using con- ditional random fields by exploiting web search click logs. We extend the constrained lattice training of T¨ackstr¨om et al. (2013) to non-linear conditional random fields in which latent variables mediate between observations and labels. When combined with a novel initialization scheme that leverages unlabeled data, we show that our method gives signifi- cant improvement over strong supervised and weakly-supervised baselines. 1 Introduction A key problem in natural language processing (NLP) is to effectively utilize large amounts of unla- beled and partially labeled data in situations where little or no annotations are available for a task of interest. Many recent work tackled this problem mostly in the context of part-of-speech (POS) tag- ging by transferring POS tags from a supervised lan- guage via automatic alignment and/or constructing tag dictionaries from the web (Das and Petrov, 2011; Li et al., 2012; T¨ackstr¨om et al., 2013). In this work, we attack this problem in the con- text of slot tagging, where the goal is to find correct semantic segmentation of a given query, which is an important task for information extraction and natu- ral language understanding. For instance, answering the question “when is the new bill murray movie re- lease date?” requires recognizing and labeling key phrases: e.g., “bill murray” as actor and “movie” as media type. The standard approach to slot tagging involves training a sequence model such as a conditional ran- dom field (CRF) on manually annotated data. An obvious limitation of this approach is that it relies on fully labeled data, which is both difficult to adapt and changing tasks and schemas. Certain films, songs, and books become more or less popular over time, and the performance of models trained on out- dated data will degrade. If not updated, models trained on live data feeds such as movies, songs and books become obsolete over time and their accuracy will degrade. In order to achieve high accuracy con- tinuously data and even model schemas have to be refreshed on a regular basis. To remedy this limitation, we propose a weakly supervised framework that utilizes the information available in web click logs. A web click log is a mapping from a user query to URL link. For ex- ample, users issuing queries about movies tend to click on links from the IMDB.com or rottentoma- toes.com, which provide rich structured data for en- tities such as title of the movie (“The Matrix”), the director (“The Wachowski Brothers”), and the re- lease date (“1999”). Web click logs present an op- portunity to learn semantic tagging …

Content truncated to 500 words

Labeled Text

In this paper, we apply a weakly-supervised learning approach for slot tagging using conditional random fields by exploiting web search click logs. We extend the constrained lattice training of T¨ackstr¨om et al. (2013) to non-linear conditional random fields in which latent variables mediate between observations and labels. When combined with a novel initialization scheme that leverages unlabeled data, we show that our method gives significant improvement over strong supervised and weakly-supervised baselines. 1

Publication Details

Paper ID:
23695
Year:
2015
Publication:
TIPSTER
Publication Type:
conf
DOI:
nan