Name
Abstract | ||
|---|---|---|
Many methods are available for computing semantic similarity between individual words, but certain NLP tasks require the comparison of word pairs. This paper presents a kernel-based framework for application to relational reasoning tasks of this kind. The model presented here combines information about two distinct types of word pair similarity: lexical similarity and relational similarity. We present an efficient and flexible technique for implementing relational similarity and show the effectiveness of combining lexical and relational models by demonstrating state-of-the-art results on a compound noun interpretation task. |
Year | Venue | Keywords |
|---|---|---|
2009 | EACL | compound noun interpretation task,semantic similarity,lexical similarity,relational similarity,word pair similarity,distinct type,word pair,relational model,certain nlp task,semantic relation,individual word,noun |
Field | DocType | Citations |
Kernel (linear algebra),Semantic similarity,Lexical similarity,Computer science,Noun,Similarity heuristic,Relational Model/Tasmania,Natural language processing,Artificial intelligence | Conference | 17 |
PageRank | References | Authors |
0.97 | 23 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Diarmuid Ó. Séaghdha | 1 | 587 | 28.29 |
| Ann Copestake | 2 | 862 | 95.10 |