Hierarchical dirichlet trees for information retrieval

5Citations
Citations of this article
112Readers
Mendeley users who have this article in their library.

Abstract

We propose a principled probabilisitc framework which uses trees over the vocabulary to capture similarities among terms in an information retrieval setting. This allows the retrieval of documents based not just on occurrences of specific query terms, but also on similarities between terms (an effect similar to query expansion). Additionally our principled generative model exhibits an effect similar to inverse document frequency. We give encouraging experimental evidence of the superiority of the hierarchical Dirichlet tree compared to standard baselines. © 2009 Association for Computational Linguistics.

Cite

CITATION STYLE

APA

Haffari, G., & Teh, Y. W. (2009). Hierarchical dirichlet trees for information retrieval. In NAACL HLT 2009 - Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Proceedings of the Conference (pp. 173–181). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1620754.1620780

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