Sciweavers

3270 search results - page 4 / 654
» Approximate String Processing
Sort
View
ICDAR
1999
IEEE
13 years 11 months ago
Partitioning and Searching Dictionary for Correction of Optically Read Devanagari Character Strings
Abstract. This paper describes a method for correction of optically read Devanagari character strings using a Hindi word dictionary. The word dictionary is partitioned in order to ...
Veena Bansal, R. M. K. Sinha
FINTAL
2006
13 years 11 months ago
Regular Approximation of Link Grammar
We present a regular approximation of Link Grammar, a dependency-type formalism with context-free expressive power, as a first step toward a finite-state joint inference system. Th...
Filip Ginter, Sampo Pyysalo, Jorma Boberg, Tapio S...
KDD
2003
ACM
214views Data Mining» more  KDD 2003»
14 years 8 months ago
Adaptive duplicate detection using learnable string similarity measures
The problem of identifying approximately duplicate records in databases is an essential step for data cleaning and data integration processes. Most existing approaches have relied...
Mikhail Bilenko, Raymond J. Mooney
IJCAI
2003
13 years 8 months ago
Employing Trainable String Similarity Metrics for Information Integration
The problem of identifying approximately duplicate objects in databases is an essential step for the information integration process. Most existing approaches have relied on gener...
Mikhail Bilenko, Raymond J. Mooney
MCS
2008
Springer
13 years 7 months ago
Numerical optimal control of the wave equation: optimal boundary control of a string to rest in finite time
In many real-life applications of optimal control problems with constraints in form of partial differential equations (PDEs), hyperbolic equations are involved which typically desc...
Matthias Gerdts, Günter Greif, Hans Josef Pes...