Publishing Partner: Cambridge University Press CUP Extra Publisher Login
amazon logo
More Info

New from Oxford University Press!


May I Quote You on That?

By Stephen Spector

A guide to English grammar and usage for the twenty-first century, pairing grammar rules with interesting and humorous quotations from American popular culture.

New from Cambridge University Press!


The Cambridge Handbook of Endangered Languages

Edited By Peter K. Austin and Julia Sallabank

This book "examines the reasons behind the dramatic loss of linguistic diversity, why it matters, and what can be done to document and support endangered languages."

Academic Paper

Title: Building Instance Knowledge Network for Word Sense Disambiguation
Paper URL:
Author: Shangfeng Hu
Email: click here TO access email
Author: Chengfei Liu
Email: click here TO access email
Institution: Swinburne University of Technology
Author: Xiaohui Zhao
Email: click here TO access email
Institution: Eindhoven University of Technology
Author: Marek Kowalkiewicz
Email: click here TO access email
Institution: SAP Research
Linguistic Field: Computational Linguistics; Semantics
Subject Language: English
Abstract: In this paper, a new high precision focused WSD approach is proposed, which not only attempts to identify the proper sense for a word but also provides the probabilistic/L/evaluation for the identification confidence at the same time. A novel Instance Knowledge Network (IKN) is built to generate and maintain semantic knowledge at the word, type synonym set and instance levels. Related algorithms based on graph matching are developed to train IKN with probabilistic knowledge and to use IKN for probabilistic word sense disambiguation. Based on the Senseval-3 all-words task, we run extensive experiments to show the performance enhancements in different precision ranges and the rationality of probabilistic based automatic confidence evaluation of disambiguation. We combine our WSD algorithm with five best WSD algorithms in senseval-3 all words tasks. The results show that the combined algorithms all outperform the corresponding/L/algorithms.
Type: Individual Paper
Status: Completed
Venue: 2011 Australasian Computer Science Conference (ACSC 2011)

Add a new paper
Return to Academic Papers main page
Return to Directory of Linguists main page