A Robust Retrieval Engine for Proximal and Structural Search
暂无分享,去创建一个
In the text retrieval area including XML and Region Algebra, many researchers pursued models for specifying what kinds of information should appear in specified structural positions and linear positions (Chinenyanga and Kushmerick, 2001; Wolff et al., 1999; Theobald and Weilkum, 2000; Clarke et al., 1995). The models attracted many researchers because they are considered to be basic frameworks for retrieving or extracting complex information like events. However, unlike IR by keyword-based search, their models are not robust, that is, they support only exact matching of queries, while we would like to know to what degree the contents in specified structural positions are relevant to those in the query even when the structure does not exactly match the query.
[1] Stephen E. Robertson,et al. Okapi/Keenbow at TREC-8 , 1999, TREC.
[2] Gerhard Weikum,et al. Adding Relevance to XML , 2000, WebDB.
[3] Jin-Dong Kim,et al. The GENIA corpus: an annotated research abstract corpus in molecular biology domain , 2002 .
[4] Charles L. A. Clarke,et al. An Algebra for Structured Text Search and a Framework for its Implementation , 1995, Comput. J..
[5] Nicholas Kushmerick,et al. Expressive and Efficient Ranked Querying of XML data , 2001, WebDB.