A model for composing semantic relations

Eduardo Blanco, Dan Moldovan

Research output: Contribution to conferencePaperpeer-review

6 Scopus citations

Abstract

This paper presents a model to compose semantic relations. The model is independent of any particular set of relations and uses an extended definition for semantic relations. This extended definition includes restrictions on the domain and range of relations and utilizes semantic primitives to characterize them. Primitives capture elementary properties between the arguments of a relation. An algebra for composing semantic primitives is used to automatically identify the resulting relation of composing a pair of compatible relations. Inference axioms are obtained. Axioms take as input a pair of semantic relations and output a new, previously ignored relation. The usefulness of this proposed model is shown using PropBank relations. Eight inference axioms are obtained and their accuracy and productivity are evaluated. The model offers an unsupervised way of accurately extracting additional semantics from text.

Original languageEnglish (US)
Pages45-54
Number of pages10
StatePublished - 2011
Externally publishedYes
Event9th International Conference on Computational Semantics, IWCS 2011 - Oxford, United Kingdom
Duration: Jan 12 2011Jan 14 2011

Other

Other9th International Conference on Computational Semantics, IWCS 2011
Country/TerritoryUnited Kingdom
CityOxford
Period1/12/111/14/11

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Information Systems

Fingerprint

Dive into the research topics of 'A model for composing semantic relations'. Together they form a unique fingerprint.

Cite this