Learning Representations for Weakly Supervised Natural Language Processing Tasks
Computational Linguistics , Volume 40 - Issue 1 p. 85- 120
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.
|Organisation||School of Computer Science|
Huang, F. (Fei), Ahuja, A. (Arun), Downey, D. (Doug), Yang, Y. (Yi), Guo, Y, & Yates, A. (Alexander). (2014). Learning Representations for Weakly Supervised Natural Language Processing Tasks. Computational Linguistics, 40(1), 85–120. doi:10.1162/COLI_a_00167