Hope, David Richard and Keller, Bill (2013) MaxMax - a graph-based soft clustering algorithm applied to word sense induction. In: Unset Unset, pp. 368-381.

Full text not available from this repository.

Abstract

This paper introduces a linear time graph-based soft clustering algorithm. The algorithm applies a simple idea: given a graph, vertex pairs are assigned to the same cluster if either vertex has maximal affinity to the other. Clusters of varying size, shape, and density are found automatically making the algorithm suited to tasks such Word Sense Induction (WSI), where the number of classes is unknown and where class distributions may be skewed. The algorithm is applied to two WSI tasks, obtaining results comparable with those of systems adopting existing, state-of-the-art methods.

Item Type:	Book Section
Schools and Departments:	School of Engineering and Informatics > Informatics
Subjects:	P Language and Literature > P Philology. Linguistics > P0098 Computational linguistics. Natural language processing Q Science > QA Mathematics > QA0075 Electronic computers. Computer science
Depositing User:	Bill Keller
Date Deposited:	15 May 2013 09:40
Last Modified:	08 Jul 2013 14:18
URI:	http://sro.sussex.ac.uk/id/eprint/41570

📧 Request an update