paper-with-me

홈 › Papers

Domain adaptation for sequence labeling using hidden Markov models

2013-12-14 · Edouard Grave, Guillaume Obozinski, Francis Bach

Most natural language processing systems based on machine learning are not robust to domain shift. For example, a state-of-the-art syntactic dependency parser trained on Wall Street Journal sentences has an absolute drop in performance of more than ten points when tested on textual data from the Web. An efficient solution to make these methods more robust to domain shift is to first learn a word representation using large amounts of unlabeled data from both domains, and then use this representation as features in a supervised learning algorithm. In this paper, we propose to use hidden Markov models to learn word representations for part-of-speech tagging. In particular, we study the influence of using data from the source, the target or both domains to learn the representation and the different ways to represent words using an HMM.

📄 PDF Abstract BibTeX arXiv:1312.4092

Code (0)

등록된 구현이 없습니다.

Tasks

Domain AdaptationPart-Of-Speech Tagging

Similar Papers 제목 키워드 기반

Supervised Opinion Aspect Extraction by Exploiting Past Extraction Results

2016-12-23 · Lei Shu, Bing Liu, Hu Xu, Annice Kim

One of the key tasks of sentiment analysis of product reviews is to extract product aspects or features that users have expressed opinions on. In this work, we focus on using supervised sequence labeling as the base appr…

Aspect ExtractionSentiment Analysis

Fine-grained Knowledge Fusion for Sequence Labeling Domain Adaptation

2019-09-10 · IJCNLP 2019 11 · Huiyun Yang, Shu-Jian Huang, Xin-yu Dai, Jia-Jun Chen

In sequence labeling, previous domain adaptation methods focus on the adaptation from the source domain to the entire target domain without considering the diversity of individual target domain samples, which may lead to…

DiversityDomain Adaptation

Learning Hidden Markov Models with Distributed State Representations for Domain Adaptation

2015-07-01 · IJCNLP 2015 7 · Min Xiao, Yuhong Guo
ChunkingDependency ParsingDomain AdaptationNamed Entity Recognition (NER)+3

Scalable Adaptation of State Complexity for Nonparametric Hidden Markov Models

2015-12-01 · NeurIPS 2015 12 · Michael C. Hughes, William T. Stephenson, Erik Sudderth

Bayesian nonparametric hidden Markov models are typically learned via fixed truncations of the infinite state space or local Monte Carlo proposals that make small changes to the state space. We develop an inference algor…

speaker-diarizationSpeaker Diarization

Mouse Movement and Probabilistic Graphical Models Based E-Learning Activity Recognition Improvement Possibilistic Model

2016-08-08 · Anis Elbahi, Mohamed Nazih Omri, Mohamed Ali Mahjoub, Kamel Garrouch

Automatically recognizing the e-learning activities is an important task for improving the online learning process. Probabilistic graphical models such as hidden Markov models and conditional random fields have been succ…

Activity Recognition