On the Robustness of Entropy-Based Similarity Measures in Evaluation of Subcategorization Acquisition Systems

1Citations
Citations of this article
70Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Some statistical learning systems are evaluated using measures of distributional similarity. To deal with the problem of zero events in the distributions under comparison, smoothing is frequently performed before similarity measures are applied. Smoothing alters the information in the original distribution, and may add noise to the results. Here, we investigate the sensi tivity of entropy-based similarity measures to noise from uninformative smoothing. Our experiments with two subcategorization acquisi tion systems show that similarity measures vary in their robustness. While some are led astray by noise from smoothing, others are more resilient.

Cite

CITATION STYLE

APA

Korhonen, A., & Krymolowski, Y. (2002). On the Robustness of Entropy-Based Similarity Measures in Evaluation of Subcategorization Acquisition Systems. In Proceedings of the Annual Meeting of the Association for Computational Linguistics. Association for Computational Linguistics (ACL). https://doi.org/10.3115/1118853.1118867

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free