LGCLDec 20, 2013

Factorial Hidden Markov Models for Learning Representations of Natural Language

arXiv:1312.6168v37 citations
Originality Incremental advance
AI Analysis

This addresses the challenge of capturing global dependencies in natural language processing for tasks like part-of-speech tagging and chunking, though it is incremental as it builds on existing representation learning approaches.

The authors tackled the problem of learning word representations that incorporate global context, rather than just local context, by developing a representation learning algorithm using Factorial Hidden Markov Models with efficient variational methods. Experiments on part-of-speech tagging and chunking showed that the features are competitive with or better than existing state-of-the-art methods.

Most representation learning algorithms for language and image processing are local, in that they identify features for a data point based on surrounding points. Yet in language processing, the correct meaning of a word often depends on its global context. As a step toward incorporating global context into representation learning, we develop a representation learning algorithm that incorporates joint prediction into its technique for producing features for a word. We develop efficient variational methods for learning Factorial Hidden Markov Models from large texts, and use variational distributions to produce features for each word that are sensitive to the entire input sequence, not just to a local context window. Experiments on part-of-speech tagging and chunking indicate that the features are competitive with or better than existing state-of-the-art representation learning methods.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes