arrow
Return

Learning Representations forWeakly Supervised Natural Language Processing Tasks

delete2014-03-01
delete26
delete
OA
AI
F
Fei Huang *
A
Arun Ahuja
D
Doug Downey
Y
Yi Yang
Y
Yuhong Guo
A
Alexander Yates
DOI:10.1162/COLI_a_00167delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Finding the right representations for words is critical for building accurate NLP systems when domain-specific labeled data for the task is scarce. This article investigates novel techniques for extracting features from n-gram models, Hidden Markov Models, and other statistical language models, including a novel Partial Lattice Markov Random Field model. Experiments on part-of-speech tagging and information extraction, among other tasks, indicate that features taken from statistical language models, in combination with more traditional features, outperform traditional representations alone, and that graphical model representations outperform n-gram models, especially on sparse and polysemous words.
Keywords:
MODELS
FIELDS
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Computational Linguistics cover
Computational Linguistics
IF:
5.3
Papers:
837
Citations:
2.7K

Organization

T
Temple University
Scholars:
1.1W
Papers: 8.8K
Citations: 1.9W
P
pennsylvania commonwealth system of higher education (pcshe)
Scholars:
12.9W
Papers: 11.7W
Citations: 177