Vilares, J.; Alonso, M.A.; Doval, Y.; Vilares, M.: Studying the effect and treatment of misspelled queries in Cross-Language Information Retrieval (2016)
0.02
0.023944447 = product of:
0.0877963 = sum of:
0.064219736 = weight(_text_:effect in 2974) [ClassicSimilarity], result of:
0.064219736 = score(doc=2974,freq=2.0), product of:
0.18289955 = queryWeight, product of:
5.29663 = idf(docFreq=601, maxDocs=44218)
0.034531306 = queryNorm
0.35112026 = fieldWeight in 2974, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.29663 = idf(docFreq=601, maxDocs=44218)
0.046875 = fieldNorm(doc=2974)
0.007916314 = weight(_text_:of in 2974) [ClassicSimilarity], result of:
0.007916314 = score(doc=2974,freq=4.0), product of:
0.053998582 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.034531306 = queryNorm
0.14660224 = fieldWeight in 2974, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.046875 = fieldNorm(doc=2974)
0.015660247 = weight(_text_:on in 2974) [ClassicSimilarity], result of:
0.015660247 = score(doc=2974,freq=4.0), product of:
0.07594867 = queryWeight, product of:
2.199415 = idf(docFreq=13325, maxDocs=44218)
0.034531306 = queryNorm
0.20619515 = fieldWeight in 2974, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
2.199415 = idf(docFreq=13325, maxDocs=44218)
0.046875 = fieldNorm(doc=2974)
0.27272728 = coord(3/11)
- Abstract
- General graph random walk has been successfully applied in multi-document summarization, but it has some limitations to process documents by this way. In this paper, we propose a novel hypergraph based vertex-reinforced random walk framework for multi-document summarization. The framework first exploits the Hierarchical Dirichlet Process (HDP) topic model to learn a word-topic probability distribution in sentences. Then the hypergraph is used to capture both cluster relationship based on the word-topic probability distribution and pairwise similarity among sentences. Finally, a time-variant random walk algorithm for hypergraphs is developed to rank sentences which ensures sentence diversity by vertex-reinforcement in summaries. Experimental results on the public available dataset demonstrate the effectiveness of our framework.
