Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/33303
Title: Using longest common subsequence matching for Chinese information retrieval
Authors: Xiao, Y
Luk, RWP 
Wong, KF
Kwok, KL
Keywords: Chinese information retrieval
Longest common subsequence
String matching
Title re-ranking
Issue Date: 2005
Publisher: Chinese and Oriental Languages Information Processing Society
Source: Journal of Chinese language and computing , 2005, v. 15, no. 1, p. 45-51 How to cite?
Journal: Journal of Chinese language and computing 
Abstract: This paper is about adopting the longest common subsequence (LCS) matching for Chinese information retrieval. We re-ranked the retrieved documents by a mixture of the original similarity score and the LCS score obtained by matching the document titles and the query. This LCS-based similarity score is also used in pseudo-relevance feedback in various ways (e.g., selecting terms and filtering documents with low LCS values). We evaluated the use of LCS in title re-ranking and PRF based on the NTCIR-4 test collection for Chinese ad hoc information retrieval. For title queries, our best MAP achieved is 26.7% evaluated using rigid relevance judgement and 30.2% evaluated using relax relevance judgement.
URI: http://hdl.handle.net/10397/33303
ISSN: 0219-5968
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

32
Last Week
4
Last month
Checked on Aug 14, 2017

Google ScholarTM

Check



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.