Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 4
Encontrada(s) 1 página(s)

Repositorio Digital de la UPF
Publicación Contribución de congreso (ConferenceOutput)

Knowledge base unification via sense embeddings and disambiguation

  • Delli Bovi, Claudio
  • Espinosa-Anke, Luis
  • Navigli, Roberto
Paper presented at The 2015 Conference on Empirical Methods in Natural Language; 2015 Sept 17-21; Lisbon, Portugal., We present KB-UNIFY, a novel approach for integrating the output of different Open Information Extraction systems into a single unified and fully disambiguated knowledge repository. KB-UNIFY consists of three main steps: (1) disambiguation of relation argument pairs via a sensebased vector representation and a large unified sense inventory; (2) ranking of semantic relations according to their degree of specificity; (3) cross-resource relation alignment and merging based on the semantic similarity of domains and ranges. We tested KB-UNIFY on a set of four heterogeneous knowledge bases, obtaining high-quality results. We discuss and provide evaluations at each stage, and release output and evaluation data for the use and scrutiny of the community., The authors gratefully acknowledge the support of the ERC Starting Grant MultiJEDI No. 259234.
Repositorio Digital de la UPF
Publicación Contribución de congreso (ConferenceOutput)

Reading between the lines: overcoming data sparsity for accurate classification of lexical relationships

  • Necşulescu, Silvia
  • Mendes, Sara
  • Jurgens, David
  • Bel Rafecas, Núria
  • Navigli, Roberto
Comunicació presentada a: 4th Joint Conference on Lexical and Computational Semantics, celebrada a Denver, Colorado, Estats Units d'Amèrica, del 4 al 5 de juny de 2015., The lexical semantic relationships between word pairs are key features for many NLP tasks. Most approaches for automatically classifying related word pairs are hindered by data sparsity because of their need to observe two words co-occurring in order to detect the lexical relation holding between them. Even when mining very large corpora, not every related word pair co-occurs. Using novel representations based on graphs and word embeddings, we present two systems that are able to predict relations between words, even when these are never found in the same sentence in a given corpus. In two experiments, we demonstrate superior performance of both approaches over the state of the art, achieving significant gains in recall., The authors gratefully acknowledge the support of the CLARA project (EU-7FP-ITN-238405), the SKATER project (Ministerio de Economia y Competitividad, TIN2012-38584-C06-05) and of the MultiJEDI ERC Starting Grant no. 259234.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Knowledge base unification via sense embeddings and disambiguation

  • Delli Bovi, Claudio
  • Espinosa-Anke, Luis
  • Navigli, Roberto
Paper presented at The 2015 Conference on Empirical Methods in Natural Language; 2015 Sept 17-21; Lisbon, Portugal., We present KB-UNIFY, a novel approach for integrating the output of different Open Information Extraction systems into a single unified and fully disambiguated knowledge repository. KB-UNIFY consists of three main steps: (1) disambiguation of relation argument pairs via a sensebased vector representation and a large unified sense inventory; (2) ranking of semantic relations according to their degree of specificity; (3) cross-resource relation alignment and merging based on the semantic similarity of domains and ranges. We tested KB-UNIFY on a set of four heterogeneous knowledge bases, obtaining high-quality results. We discuss and provide evaluations at each stage, and release output and evaluation data for the use and scrutiny of the community., The authors gratefully acknowledge the support of the ERC Starting Grant MultiJEDI No. 259234.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Reading between the lines: overcoming data sparsity for accurate classification of lexical relationships

  • Necşulescu, Silvia
  • Mendes, Sara
  • Jurgens, David
  • Bel Rafecas, Núria
  • Navigli, Roberto
Comunicació presentada a: 4th Joint Conference on Lexical and Computational Semantics, celebrada a Denver, Colorado, Estats Units d'Amèrica, del 4 al 5 de juny de 2015., The lexical semantic relationships between word pairs are key features for many NLP tasks. Most approaches for automatically classifying related word pairs are hindered by data sparsity because of their need to observe two words co-occurring in order to detect the lexical relation holding between them. Even when mining very large corpora, not every related word pair co-occurs. Using novel representations based on graphs and word embeddings, we present two systems that are able to predict relations between words, even when these are never found in the same sentence in a given corpus. In two experiments, we demonstrate superior performance of both approaches over the state of the art, achieving significant gains in recall., The authors gratefully acknowledge the support of the CLARA project (EU-7FP-ITN-238405), the SKATER project (Ministerio de Economia y Competitividad, TIN2012-38584-C06-05) and of the MultiJEDI ERC Starting Grant no. 259234.