Computing Word Classes Using Spectral Clustering
Clustering a lexicon of words is a well-studied problem in natural language processing (NLP). Word clusters are used to deal with sparse data in statistical language processing, as well as features for solving various NLP tasks (text categorization, question answering, named entity recognition and others). Spectral clustering is a widely used technique in the field of image processing and speech recognition. However, it has scarcely been explored in the context of NLP; specifically, the method used in this (Meila and Shi, 2001) has never been used to cluster a general word lexicon. We apply spectral clustering to a lexicon of words, evaluating the resulting clusters by using them as features for solving two classical NLP tasks: semantic role labeling and dependency parsing. We compare performance with Brown clustering, a widely-used technique for word clustering, as well as with other clustering methods. We show that spectral clusters produce similar results to Brown clusters, and outperform other clustering methods. In addition, we quantify the overlap between spectral and Brown clusters, showing that each model captures some information which is uncaptured by the other.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringDependency Parsingnamed-entity-recognitionNamed Entity RecognitionNamed Entity Recognition (NER)Question AnsweringSemantic Role Labelingspeech-recognitionSpeech RecognitionText CategorizationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Parallel Spectral Clustering Algorithm Based on Hadoop
Spectral clustering and cloud computing is emerging branch of computer science or related discipline. It overcome the shortcomings of some traditional clustering algorithm and guarantee the convergence to the optimal sol…
Cloud ComputingClusteringA Distributed Block Chebyshev-Davidson Algorithm for Parallel Spectral Clustering
We develop a distributed Block Chebyshev-Davidson algorithm to solve large-scale leading eigenvalue problems for spectral analysis in spectral clustering. First, the efficiency of the Chebyshev-Davidson algorithm relies …
ClusteringSemantic Word Clusters Using Signed Spectral Clustering
Vector space representations of words capture many aspects of word similarity, but such methods tend to produce vector spaces in which antonyms (as well as synonyms) are close to each other. For spectral clustering using…
ClusteringGraph ClusteringSemantic Textual SimilarityWord Embeddings+1Discretize Relaxed Solution of Spectral Clustering via a Non-Heuristic Algorithm
Spectral clustering and its extensions usually consist of two steps: (1) constructing a graph and computing the relaxed solution; (2) discretizing relaxed solutions. Although the former has been extensively investigated,…
ClusteringScalable Spectral Clustering with Nystrom Approximation: Practical and Theoretical Aspects
Spectral clustering techniques are valuable tools in signal processing and machine learning for partitioning complex data sets. The effectiveness of spectral clustering stems from constructing a non-linear embedding base…
Clustering