A Simple, Similarity-based Model for Selectional Preferences
Published 1 December 2007
Katrin Erk
Citations138
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A new, simple model for the automatic induction of selectional preferences, using corpus-based semantic similarity metrics, focuses on the task of semantic role labeling and shows lower error rates than both Resnik's WordNet-based model and the EM-based clustering model.
Abstract
We propose a new, simple model for the automatic induction of selectional preferences, using corpus-based semantic similarity metrics. Focusing on the task of semantic role labeling, we compute selectional preferences for semantic roles. In evaluations the similarity-based model shows lower error rates than both Resnik’s WordNet-based model and the EM-based clustering model, but has coverage problems. 1
Keywords
Computer Science
Neural ComputationApproximate Statistical Tests for Comparing Supervised Classification Learning Algorithms
3,654 Citations1998Thomas G. Dietterich
This article reviews five approximate statistical tests for determining whether one learning algorithm outperforms another on a particular learning task and measures the power (ability to detect algorithm differences when they do exist) of these tests.
The Berkeley FrameNet Project
2,564 Citations1998Collin F. Baker, Charles J. Fillmore +1 more
This report will present the project's goals and workflow, and information about the computational tools that have been adapted or created in-house for this work.
Computational LinguisticsAutomatic Labeling of Semantic Roles
1,647 Citations2002Daniel Gildea, Daniel Jurafsky
Automatic retrieval and clustering of similar words
1,555 Citations1998Dekang Lin
A word similarity measure based on the distributional pattern of words allows the automatically constructed thesaurus to be significantly closer to WordNet than Roget Thesaurus is.
Computational LinguisticsEvaluating WordNet-based Measures of Lexical Semantic Relatedness
1,414 Citations2006Alexander Budanitsky, Graeme Hirst
An information-content-based measure proposed by Jiang and Conrath is found superior to those proposed by Hirst and St-Onge, Leacock and Chodorow, Lin, and Resnik, and why distributional similarity is not an adequate proxy for lexical semantic relatedness.
Three generative, lexicalised models for statistical parsing
749 Citations1997Michael Collins
A new statistical parsing model is proposed, which is a generative model of lexicalised context-free grammar and extended to include a probabilistic treatment of both subcategorisation and wh-movement.
Introduction to the CoNLL-2005 shared task
649 Citations2005Xavier Carreras, Lluı́s Màrquez
The specification and goals of the task are introduced, the data sets and evaluation methods are described, and a general overview of the 19 systems that have contributed to the task is presented, providing a comparative description and results.
Noun classification from predicate-argument structures
543 Citations1990Donald Hindle
The resulting quasi-semantic classification of nouns demonstrates the plausibility of the distributional hypothesis, and has potential application to a variety of tasks, including automatic indexing, resolving nominal compounds, and determining the scope of modification.
CognitionSelectional constraints: an information-theoretic model and its computational realization
296 Citations1996Philip Resnik
The information-theoretic approach avoids empirical problems associated with definitional theories of word meaning, accommodates the observation that semantic anomaly often appears to be a matter of degree, and provides an account of how selectional constraints can be learned.
Principle-based parsing without overgeneration
168 Citations1993Dekang Lin
A message passing algorithm for principle-based parsing that avoids the overgeneration problem is presented and has been implemented in C++ and successfully tested with example sentences from (van Riemsdijk and Williams, 1986).
Inducing a semantically annotated lexicon via EM-based clustering
153 Citations1999Mats Rooth, Stefan Riezler +3 more
A technique for automatic induction of slot annotations for subcategorization frames, based on induction of hidden classes in the EM framework of statistical estimation, and an interpretation of the learned representations as theoretical-linguistic decompositional lexical entries are presented.
Computational LinguisticsDisambiguating Nouns, Verbs, and Adjectives Using Automatically Acquired Selectional Preferences
141 Citations2003Diana McCarthy, John Carroll
Although the preferences perform well in comparison with other unsupervised WSD systems on the same corpus, the results show that for many applications, further knowledge sources would be required to achieve an adequate level of accuracy and coverage.
Evaluating and combining approaches to selectional preference acquisition
45 Citations2003Carsten Brockmann, Mirella Lapata
This paper focuses on class-based models of selectional preferences for German verbs and takes into account not only direct objects, but also subjects and prepositional complements, and demonstrates that model combination enhances agreement with human ratings.
arXiv (Cornell University)Learning Word Association Norms Using Tree Cut Pair Models
43 Citations1996Naoki Abe, Hang Li
Class-based probability estimation using a semantic hierarchy
28 Citations2001Stephen Clark, David Weir
This paper concerns the acquisition of a particular kind of lexical knowledge, namely the knowledge of which noun senses can fill argument slots of predicates, and classes from a semantic hierarchy are used to estimate the probabilities.