UoS: a graph-based system for graded word sense induction

Hope, David and Keller, Bill (2013) UoS: a graph-based system for graded word sense induction. Second Joint Conference on Lexical and Computational Semantics (*SEM), Volume 2: Proceedings of the Seventh International Workshop on Semantic Evaluation (SemEval 2013). pp. 689-694.

PDF - Published Version
Available under License Creative Commons Attribution No Derivatives.

Download (237kB) | Preview


This paper presents UoS, a graph-based Word Sense Induction system which attempts to find all applicable senses of a target word given its context, grading each sense according to its suitability to the context. Senses of a target word are induced through use of a non-parameterised, linear-time clustering algorithm that returns maximal quasi-strongly connected components of a target word graph in which vertex pairs are assigned to the same cluster if either vertex has the highest edge weight to the other. UoS participated in SemEval-2013 Task 13: Word Sense Induction for Graded and Non-Graded Senses. Two system were submitted; both systems returned results comparable with those of the best performing systems.

Item Type: Article
Keywords: word sense induction, clustering, graphs, natural language processing
Schools and Departments: School of Engineering and Informatics > Informatics
Subjects: P Language and Literature > P Philology. Linguistics > P0098 Computational linguistics. Natural language processing
Related URLs:
Depositing User: Bill Keller
Date Deposited: 27 Feb 2015 07:58
Last Modified: 03 Jul 2019 01:24
URI: http://sro.sussex.ac.uk/id/eprint/45335

View download statistics for this item

📧 Request an update