SODA

Selective compound splitting of Swedish queries for boolean combination of truncated terms

Cöster, Rickard and Sahlgren, Magnus and Karlgren, Jussi (2003) Selective compound splitting of Swedish queries for boolean combination of truncated terms. In: Fourth CLEF workshop, 21-22 Aug 2003, Trondheim, Norway.

Full text not available from this repository.

Abstract

In compounding languages such as Swedish, it is often neccessary to split compound words when indexing documents or queries. One of the problems is that it is difficult to find constituents that express a concept similar to that expressed by the compound. The approach taken here is to expand a query with the leading constituents of the compound words. Every query term is truncated so as to increase recall by hopefully finding other compounds with the leading constituent as prefix. This approach increase recall in a rather uncontrolled way, so we use a Boolean quorum-level type of search to rank documents both according to a tf-idf factor but also to the number of matching Boolean combinations. The Boolean combinations performed relatively well, taken into consideration that the queries were very short (maximum five search terms). Also included in this paper are the results of two other methods we are currently working on in our lab; one for re-ranking search results on the basis of stylistic analysis of documents, and one for dimensionality reduction using Random Indexing.

Item Type:Conference or Workshop Item (Paper)
ID Code:2804
Deposited By:INVALID USER
Deposited On:13 Jun 2008
Last Modified:18 Nov 2009 16:14

Repository Staff Only: item control page