2089 search results - page 119 / 418 » A New Problem in String Searching |
112
click to vote
ACL
1990
15 years 4 months ago
1990
In the literature, Tree Adjoining Grammars (TAGs) are propagated to be adequate for natural language description -- analysis as well as generation. In this paper we concentrate on...
184
click to vote
CPM
2009
Springer
15 years 24 days ago
2009
Springer
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
111
click to vote
SAC
2005
ACM
15 years 8 months ago
2005
ACM
We investigate the problem of evaluating the performance of text processing algorithms on inputs that contain errors as a result of optical character recognition. A new hierarchic...
124
click to vote
IDA
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. We propose a new unsupervised training method for acquiring probability models that accurately segment Chinese character sequences into words. By constructing a core lexi...
121
click to vote
CC
2008
Springer
15 years 3 months ago
2008
Springer
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...