The purpose of this thesis is to compare five different ranking algorithms for query expansion. The algorithms compared are f4, f4mod, porter, wpq, and emim. This is done using a TREC collection, a selection of topics, and relevance judgements. Relative recall is measured before and after the expansion of the query. The study shows that all of the algorithms manage to increase the relative recall, f4 being the one most successful. / Uppsatsnivå: D
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:hb-18322 |
| Date | January 2002 |
| Creators | Eklund, Johan, Stenström, Anders |
| Publisher | Högskolan i Borås, Institutionen Biblioteks- och informationsvetenskap / Bibliotekshögskolan, Högskolan i Borås, Institutionen Biblioteks- och informationsvetenskap / Bibliotekshögskolan, University College of Borås. Swedish School of Library and Information Science |
| Source Sets | DiVA Archive at Upsalla University |
| Language | Swedish |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | Magisteruppsats i biblioteks- och informationsvetenskap vid Bibliotekshögskolan/Biblioteks- och informationsvetenskap, 1404-0891 ; 2002:9 |
Page generated in 0.0057 seconds