Sciweavers

5 search results - page 1 / 1
» SensEmbed: Learning Sense Embeddings for Word and Relational...
Sort
View
NAACL
2010
13 years 2 months ago
Taxonomy Learning Using Word Sense Induction
Taxonomies are an important resource for a variety of Natural Language Processing (NLP) applications. Despite this, the current stateof-the-art methods in taxonomy learning have d...
Ioannis P. Klapaftis, Suresh Manandhar
ACL
2003
13 years 6 months ago
Syntactic Features and Word Similarity for Supervised Metonymy Resolution
We present a supervised machine learning algorithm for metonymy resolution, which exploits the similarity between examples of conventional metonymy. We show that syntactic head-mo...
Malvina Nissim, Katja Markert
CIARP
2004
Springer
13 years 10 months ago
Unsupervised Learning of Ontology-Linked Selectional Preferences
We present a method for extracting selectional preferences of verbs from unannotated text. These selectional preferences are linked to an ontology (e.g. the hypernym relations foun...
Hiram Calvo, Alexander F. Gelbukh
JMLR
2011
192views more  JMLR 2011»
12 years 12 months ago
Minimum Description Length Penalization for Group and Multi-Task Sparse Learning
We propose a framework MIC (Multiple Inclusion Criterion) for learning sparse models based on the information theoretic Minimum Description Length (MDL) principle. MIC provides an...
Paramveer S. Dhillon, Dean P. Foster, Lyle H. Unga...
SIAMCOMP
2008
107views more  SIAMCOMP 2008»
13 years 4 months ago
Holographic Algorithms
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
Leslie G. Valiant