Interpolated PLSI for learning plausible verb arguments

Hiram Calvo, Kentaro Inui, Yuji Matsumoto

Producción científica: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

1 Cita (Scopus)

Resumen

Learning Plausible Verb Arguments allows to automatically learn what kind of activities, where and how, are performed by classes of entities from sparse argument co-occurrences with a verb; this information it is useful for sentence reconstruction tasks. Calvo et al. (2009b) propose a non language-dependent model based on the Word Space Model for calculating the plausibility of candidate arguments given one verb and one argument, and compare with the single latent variable PLSI algorithm method, outperforming it. In this work we replicate their experiments with a different corpus, and explore variants to the PLSI method in order to explore further capabilities of this latter widely used technique. Particularly, we propose using an interpolated PLSI scheme that allows the combination of multiple latent semantic variables, and validate it in a task of identifying the real dependency-pair triple with regard to an artificially created one, obtaining up to 83% recall.

Idioma originalInglés
Título de la publicación alojadaPACLIC 23 - Proceedings of the 23rd Pacific Asia Conference on Language, Information and Computation
Páginas622-629
Número de páginas8
EstadoPublicada - 2009
Evento23rd Pacific Asia Conference on Language, Information and Computation, PACLIC 23 - Hong Kong, China
Duración: 3 dic. 20095 dic. 2009

Serie de la publicación

NombrePACLIC 23 - Proceedings of the 23rd Pacific Asia Conference on Language, Information and Computation
Volumen2

Conferencia

Conferencia23rd Pacific Asia Conference on Language, Information and Computation, PACLIC 23
País/TerritorioChina
CiudadHong Kong
Período3/12/095/12/09

Huella

Profundice en los temas de investigación de 'Interpolated PLSI for learning plausible verb arguments'. En conjunto forman una huella única.

Citar esto