Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics on Computational Linguistics - 1999
DOI: 10.3115/1034678.1034703
|View full text |Cite
|
Sign up to set email alerts
|

Inducing a semantically annotated lexicon via EM-based clustering

Abstract: We present a technique for automatic induction of slot annotations for subcategorization frames, based on induction of hidden classes in the EM framework of statistical estimation. The models are empirically evalutated by a general decision test. Induction of slot labeling for subcategorization frames is accomplished by a further application of EM, and applied experimentally on frame observations derived from parsing large corpora. We outline an interpretation of the learned representations as theoretical-ling… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
127
1
1

Year Published

2003
2003
2014
2014

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 80 publications
(130 citation statements)
references
References 9 publications
1
127
1
1
Order By: Relevance
“…K-means is a standard flat, hard-clustering algorithm; we used the Weka implementation (Witten and Frank, 2005). LSC (Rooth, 1998;Rooth et al, 1999) is a two-dimensional soft-clustering algorithm which learns three probability distributions: one for the clusters, and one for the output probabilities of each element and for each feature type with regard to a cluster. The latter two (elements and features) correspond to the two dimensions of the clustering.…”
Section: Clustering Methodsmentioning
confidence: 99%
“…K-means is a standard flat, hard-clustering algorithm; we used the Weka implementation (Witten and Frank, 2005). LSC (Rooth, 1998;Rooth et al, 1999) is a two-dimensional soft-clustering algorithm which learns three probability distributions: one for the clusters, and one for the output probabilities of each element and for each feature type with regard to a cluster. The latter two (elements and features) correspond to the two dimensions of the clustering.…”
Section: Clustering Methodsmentioning
confidence: 99%
“…That can be useful in real WSD. Others who have worked on variations of PWSD include Gale et al (1992); Schütze (1998); Lee (1999); Dagan et al (1999); Rooth et al (1999); Clark and Weir (2002); Weeds and Weir (2005); ZhitomirskyGeffet and Dagan (2009). The methodology we followed was similar to that of Weeds and Weir.…”
Section: Pseudo-word-sense Disambiguationmentioning
confidence: 99%
“…In recent years, a number of approaches have been proposed for dealing computationally with selectional preference acquisition (Resnik (1996); Briscoe and Carroll (1997); McCarthy (1997); Rooth et al (1999); Abney and Light (1999); Ciaramita and Johnson (2000); Korhonen (2002)). …”
Section: Selectional Preference Acquisitionmentioning
confidence: 99%