Leppanen, E.: Homografiongelma tekstihaussa ja homografien disambiguoinnin vaikutukset (1996)
0.01
0.013419857 = product of:
0.04025957 = sum of:
0.04025957 = weight(_text_:search in 27) [ClassicSimilarity], result of:
0.04025957 = score(doc=27,freq=2.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.230407 = fieldWeight in 27, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.046875 = fieldNorm(doc=27)
0.33333334 = coord(1/3)
- Abstract
- Homonymy is known to often cause false drops in free text searching in a full text database. The problem is quite common and difficult to avoid in Finnish, but nobody has examined it before. Reports on a study that examined the frequency of, and solutions to, the homonymy problem, based on searches made in a Finnish full text database containing about 55.000 newspaper articles. The results indicate that homonymy is not a very serious problem in full text searching, with only about 1 search result set out of 4 containing false drops caused by homonymy. Several other reasons for nonrelevance were much more common. However, in some set results there were a considerable number of homonymy errors, so the number seems to be very random. A study was also made into whether homonyms can be disambiguated by syntactic analysis. The result was that 75,2% of homonyms were disambiguated by this method. Verb homonyms were considerably easier to disambiguate than substantives. Although homonymy is not a very big problem it could perhaps easily be eliminated if there was a suitable syntactic analyzer in the IR system
