Fully unsupervised graph-based discovery of general-specific noun relationships from web corpora frequency counts

Authors:
Gaël Dias;Raycho Mukelov;Guillaume Cleuziou
Affiliations:
University of Beira Interior;University of Beira Interior;University of Orléans
Venue:
CoNLL '08 Proceedings of the Twelfth Conference on Computational Natural Language Learning
Year:
2008

Citing 9
Cited 1

Explorations in Automatic Thesaurus Discovery

Explorations in Automatic Thesaurus Discovery
Selecting the right objective measure for association analysis

Information Systems - Knowledge discovery and data mining (KDD 2002)
Automatic acquisition of hyponyms from large text corpora

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Automatic construction of a hypernym-labeled noun hierarchy from text

ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Measuring semantic similarity between words using web search engines

Proceedings of the 16th international conference on World Wide Web
Googleology is Bad Science

Computational Linguistics
Combining association measures for collocation extraction

COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
Comparing information extraction pattern models

IEBeyondDoc '06 Proceedings of the Workshop on Information Extraction Beyond The Document
Automatic knowledge representation using a graph-based algorithm for language-independent lexical chaining

IEBeyondDoc '06 Proceedings of the Workshop on Information Extraction Beyond The Document

A pretopological framework for the automatic construction of lexical-semantic structures from texts

Proceedings of the 20th ACM international conference on Information and knowledge management

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a new methodology based on directed graphs and the TextRank algorithm to automatically induce general-specific noun relations from web corpora frequency counts. Different asymmetric association measures are implemented to build the graphs upon which the TextRank algorithm is applied and produces an ordered list of nouns from the most general to the most specific. Experiments are conducted based on the WordNet noun hierarchy and assess 65.69% of correct word ordering.