Sciweavers

159 search results - page 11 / 32
» Chinese String Searching Using The KMP Algorithm
Sort
View
IPPS
2002
IEEE
15 years 2 months ago
Approximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee
ACL
1998
14 years 11 months ago
Machine Translation with a Stochastic Grammatical Channel
We introduce a stochastic grammatical channel model for machine translation, that synthesizes several desirable characteristics of both statistical and grammatical machine transla...
Dekai Wu, Hongsing Wong
ICDE
2004
IEEE
105views Database» more  ICDE 2004»
15 years 11 months ago
SPINE: Putting Backbone into String Indexing
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
Naresh Neelapala, Romil Mittal, Jayant R. Haritsa
WWW
2008
ACM
15 years 10 months ago
Substructure similarity measurement in chinese recipes
Improving the precision of information retrieval has been a challenging issue on Chinese Web. As exemplified by Chinese recipes on the Web, it is not easy/natural for people to us...
Liping Wang, Qing Li, Na Li, Guozhu Dong, Yu Yang
86
Voted
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
15 years 1 months ago
String transformation-based Bayesian classification or proteins
We describe a Markov chain Bayesian classification tool, SCS, that can perform data-driven classification of proteins and protein segments. Training data for interesting classific...
Timothy Meekhof, Gary W. Daughdrill, Robert B. Hec...