Unsupervised Large-Vocabulary Word Sense Disambiguation with Graph-based Algorithms for Sequence Data Labeling

PDF Version Also Available for Download.

Description

This paper introduces a graph-based algorithm for sequence data labeling, using random walks on graphs encoding label dependencies. The algorithm is illustrated and tested in the context of an unsupervised word sense disambiguation problem, and shown to significantly outperform the accuracy achieved through individual label assignment, as measured on standard sense-annotated data sets.

Physical Description

8 p.

Creation Information

Mihalcea, Rada, 1974- October 2005.

Context

This paper is part of the collection entitled: UNT Scholarly Works and was provided by UNT College of Engineering to Digital Library, a digital repository hosted by the UNT Libraries. It has been viewed 220 times . More information about this paper can be viewed below.

Who

People and organizations associated with either the creation of this paper or its content.

Author

Publisher

Rights Holders

For guidance see Citations, Rights, Re-Use.

  • Unknown

Provided By

UNT College of Engineering

The UNT College of Engineering promotes intellectual and scholarly pursuits in the areas of computer science and engineering, preparing innovative leaders in a variety of disciplines. The UNT College of Engineering encourages faculty and students to pursue interdisciplinary research among numerous subjects of study including databases, numerical analysis, game programming, and computer systems architecture.

Contact Us

What

Descriptive information to help identify this paper. Follow the links below to find similar items on the Digital Library.

Degree Information

Description

This paper introduces a graph-based algorithm for sequence data labeling, using random walks on graphs encoding label dependencies. The algorithm is illustrated and tested in the context of an unsupervised word sense disambiguation problem, and shown to significantly outperform the accuracy achieved through individual label assignment, as measured on standard sense-annotated data sets.

Physical Description

8 p.

Source

  • Joint Conference on Human Language Technology / Empirical Methods in Natural Language Processing (HLT/EMNLP), 2005, Vancouver, British Columbia, Canada

Language

Item Type

Collections

This paper is part of the following collection of related materials.

UNT Scholarly Works

The Scholarly Works Collection is home to materials from the University of North Texas community's research, creative, and scholarly activities and serves as UNT's Open Access Repository. It brings together articles, papers, artwork, music, research data, reports, presentations, and other scholarly and creative products representing the expertise in our university community.** Access to some items in this collection may be restricted.**

What responsibilities do I have when using this paper?

When

Dates and time periods associated with this paper.

Creation Date

  • October 2005

Added to The UNT Digital Library

  • Jan. 31, 2011, 2:01 p.m.

Description Last Updated

  • June 24, 2013, 3:19 p.m.

Usage Statistics

When was this paper last used?

Yesterday: 0
Past 30 days: 1
Total Uses: 220

Interact With This Paper

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

Citations, Rights, Re-Use

Mihalcea, Rada, 1974-. Unsupervised Large-Vocabulary Word Sense Disambiguation with Graph-based Algorithms for Sequence Data Labeling, paper, October 2005; [Stroudsburg, Pennsylvania]. (digital.library.unt.edu/ark:/67531/metadc30977/: accessed February 28, 2017), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT College of Engineering.