101 search results - page 11 / 21 » On String Matching in Chunked Texts |
KDD
2002
ACM
14 years 7 months ago
2002
ACM
The task of object identification occurs when integrating information from multiple websites. The same data objects can exist in inconsistent text formats across sites, making it ...
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
Bidirectional programming languages are a practical approach to the view update problem. Programs in these languages, called lenses, define both a view and an update policy--i.e.,...
BIRTHDAY
2010
Springer
13 years 10 months ago
2010
Springer
Given two strings, a pattern P of length m and a text T of length n over some alphabet of size , we consider the exact string matching problem, i.e. we want to report all occurren...
CPM
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
SIGIR
2009
ACM
14 years 2 months ago
2009
ACM
Cross Language Information Retrieval (CLIR) between languages of the same origin is an interesting topic of research. The similarity of the writing systems used for these language...