3270 search results - page 92 / 654 » Approximate String Processing |
ITA
2007
13 years 10 months ago
2007
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...
CJ
1999
13 years 9 months ago
1999
Problems in probabilistic induction are of two general kinds. In the first, we have a linearly ordered sequence of symbols that must be extrapolated. In the second we want to extr...
SPIRE
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. The classical set theory provides a method for comparing objects using cardinality and intersection, in combination with well-known resemblance coefficients such as Dice,...
CPM
2004
Springer
14 years 3 months ago
2004
Springer
Given a set S = {s1, s2, . . . , sn} of strings each of length m, and an integer L, we study the following two problems. k-Closest Substring problem: find k center strings c1, c2,...
FOSSACS
2003
Springer
14 years 3 months ago
2003
Springer
In previous work we have investigated a notion of approximate bisimilarity for labelled Markov processes. We argued that such a notion is more realistic and more feasible to compu...