UNSUPERVISED COMBINATION OF METRICS FOR SEMANTIC CLASS INDUCTION
Iosif, E.
Tegos, A.
Pangos, A.
Fosler-Lussier, E.
Potamianos, A.
Dept. of Electron. & Comput. Eng., Tech. Univ. of Crete, Chania;
This paper appears in: Spoken Language Technology Workshop, 2006. IEEE
Publication Date: 10-13 Dec. 2006
On page(s): 86-89
Location: Palm Beach,
ISBN: 1-4244-0872-5
INSPEC Accession Number: 10251478
Digital Object Identifier: 10.1109/SLT.2006.326823
Current Version Published: 2007-03-19
Abstract
In this paper, unsupervised algorithms for combining semantic similarity metrics are proposed for the problem of automatic class induction. The automatic class induction algorithm is based on the work of Pargellis et al,. The semantic similarity metrics that are evaluated and combined are based on narrow- and wide-context vector- product similarity. The metrics are combined using linear weights that are computed 'on the fly' and are updated at each iteration of the class induction algorithm, forming a corpus-independent metric. Specifically, the weight of each metric is selected to be inversely proportional to the inter-class similarity of the classes induced by that metric and for the current iteration of the algorithm. The proposed algorithms are evaluated on two corpora: a semantically heterogeneous news domain (HR-Net) and an application-specific travel reservation corpus (ATIS). It is shown, that the (unsupervised) adaptive weighting scheme outperforms the (supervised) fixed weighting scheme. Up to 50% relative error reduction is achieved by the adaptive weighting scheme.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
