Airio, E.; Kettunen, K.: Does dictionary based bilingual retrieval work in a non-normalized index? (2009)
0.01
0.006877549 = product of:
0.020632647 = sum of:
0.020632647 = product of:
0.06189794 = sum of:
0.06189794 = weight(_text_:retrieval in 4224) [ClassicSimilarity], result of:
0.06189794 = score(doc=4224,freq=8.0), product of:
0.15433937 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.051022716 = queryNorm
0.40105087 = fieldWeight in 4224, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.046875 = fieldNorm(doc=4224)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- Abstract
- Many operational IR indexes are non-normalized, i.e. no lemmatization or stemming techniques, etc. have been employed in indexing. This poses a challenge for dictionary-based cross-language retrieval (CLIR), because translations are mostly lemmas. In this study, we face the challenge of dictionary-based CLIR in a non-normalized index. We test two optional approaches: FCG (Frequent Case Generation) and s-gramming. The idea of FCG is to automatically generate the most frequent inflected forms for a given lemma. FCG has been tested in monolingual retrieval and has been shown to be a good method for inflected retrieval, especially for highly inflected languages. S-gramming is an approximate string matching technique (an extension of n-gramming). The language pairs in our tests were English-Finnish, English-Swedish, Swedish-Finnish and Finnish-Swedish. Both our approaches performed quite well, but the results varied depending on the language pair. S-gramming and FCG performed quite equally in all the other language pairs except Finnish-Swedish, where s-gramming outperformed FCG.
