Sciweavers

329 search results - page 8 / 66
» An algorithm for recognition of n-collapsing words
Sort
View
INFORMATICALT
2007
80views more  INFORMATICALT 2007»
15 years 4 months ago
Recognition Algorithm for Diamond-Free Graphs
In this paper we recall the notion of weakly decomposition, we recall some necessary and sufficient conditions for a graph to admit such a decomposition, we introduce the recognit...
Mihai Talmaciu, Elena Nechita
ICDAR
1995
IEEE
15 years 8 months ago
Visual inter-word relations and their use in OCR postprocessing
A technique is presented that uses visual relationships between word images in a document to improve the recognition of the text it contains. This technique takes advantage of the...
Tao Hong, Jonathan J. Hull
IPL
2010
69views more  IPL 2010»
15 years 3 months ago
A simple representation of subwords of the Fibonacci word
We introduce a representation of subwords of the infinite Fibonacci word f∞ by a specific concatenation of finite Fibonacci words. It is unique and easily computable by backwa...
Bartosz Walczak
360
Voted
ICDAR
2011
IEEE
14 years 4 months ago
Fast Key-Word Searching via Embedding and Active-DTW
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
Raid Saabni, Alex Bronstein
ACL
1998
15 years 6 months ago
Automatic Acquisition of Language Model based on Head-Dependent Relation between Words
Language modeling is to associate a sequence of words with a priori probability, which is a key part of many natural language applications such as speech recognition and statistic...
Seungmi Lee, Key-Sun Choi