31 search results - page 2 / 7 » Tree patterns with Full Text Search |
CCP
2011
12 years 4 months ago
2011
—The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the abili...
VLDB
1993
ACM
13 years 9 months ago
1993
ACM
There are many advantages to be gained by storing the lexicon of a full text database in main memory. In this paper we describe how to use a compressed inverted file index to sear...
ANLP
1997
13 years 6 months ago
1997
A multilingual Internet-based employment advertisement system is described. Job ads are submitted as e-mailtexts, analysed by an example-based pattern matcher and stored in langua...
ISAAC
2001
Springer
13 years 9 months ago
2001
Springer
We consider the problem of developing algorithms for the recognition of a fixed pattern within a permutation. These methods are based upon using a carefully chosen chain or tree ...
MEDINFO
2007
13 years 6 months ago
2007
Many digital libraries use hierarchical indexing schema, such as MeSH to enable concept based search in the retrieval phase. However, improving or outperforming the traditional fu...