Learning co-relations of plausible verb arguments with a WSM and a distributional thesaurus

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We propose a model based on the Word Space Model for calculating the plausibility of candidate arguments given one verb and one argument. The resulting information can be used in co-reference resolution, zero-pronoun resolution or syntactic ambiguity tasks. Previous work such as Selectional Preferences or Semantic Frames acquisition focuses on this task using supervised resources, or predicting arguments independently from each other. On this work we explore the extraction of plausible arguments considering their co-relation, and using no more information than that provided by the dependency parser. This creates a data sparseness problem alleviated by using a distributional thesaurus built from the same data for smoothing. We compare our model with the traditional PLSI method. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Calvo, H., Inui, K., & Matsumoto, Y. (2009). Learning co-relations of plausible verb arguments with a WSM and a distributional thesaurus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5856 LNCS, pp. 363–370). https://doi.org/10.1007/978-3-642-10268-4_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free