4343 search results - page 366 / 869 » Improving Visual Matching |
121
click to vote
SPIRE
2001
Springer
15 years 9 months ago
2001
Springer
Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings. The £rst algorithm is an improvement of Hirschberg’s divide-andc...
130
click to vote
COCOON
1999
Springer
15 years 8 months ago
1999
Springer
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
LREC
2010
15 years 6 months ago
2010
This paper proposes statistical analysis methods for improvement of terminology entry compounding. Terminology entry compounding is a mechanism that identifies matching entries ac...
CORR
2004
Springer
15 years 4 months ago
2004
Springer
The Metaphone algorithm applies the phonetic encoding of orthographic sequences to simplify words prior to comparison. While Metaphone has been highly successful for the English l...
139
click to vote
IMCSIT
2010
15 years 2 months ago
2010
Abstract--We present a method for improving existing statistical machine translation methods using an knowledge-base compiled from a bilingual corpus as well as sequence alignment ...