Decomposing text processing for retrieval: Cheshire tries GRID@CLEF

0Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This short paper describes Berkeley's participation in the GRID@CLEF task. The GRID@CLEF task is intended to capture in XML form the intermediate results of the text processing phases of the indexing process used by IR systems. Our approach was to create a new instrumented version of the indexing program used with the Cheshire II system. Thanks to an extension by the organizers, we were able to submit runs derived from our system. The system used for this task is a modified version of the Cheshire II IR system, to which output files for the different intermediate streams have been added. The additions, like the original system were written in C. Developing this system required creating parallel modules for several elements of the Cheshire II indexing programs. The current version handles the simplest processing cases, and currently ignores the many specialized indexing modes in the system (such as geographic name extraction and georeferencing). © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Larson, R. R. (2010). Decomposing text processing for retrieval: Cheshire tries GRID@CLEF. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6241 LNCS, pp. 566–569). https://doi.org/10.1007/978-3-642-15754-7_69

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free