Combining pattern-based and distributional similarity for graph-based noun categorization

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

Abstract

We examine the combination of pattern-based and distributional similarity for the induction of semantic categories. Pattern-based methods are precise and sparse while distributional methods have a higher recall. Given these particular properties we use the prediction of distributional methods as a back-off to pattern-based similarity. Since our pattern-based approach is embedded into a semi-supervised graph clustering algorithm, we also examine how distributional information is best added to that classifier. Our experiments are carried out on 5 different food categorization tasks.

Cite

CITATION STYLE

APA

Wiegand, M., Roth, B., & Klakow, D. (2015). Combining pattern-based and distributional similarity for graph-based noun categorization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9103, pp. 64–72). Springer Verlag. https://doi.org/10.1007/978-3-319-19581-0_5

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