Displaying similar documents to “Hausdorff Distances for Searching in Binary Text Images”

An isolated word recognition system based on a low-complexity parametrization procedure.

Héctor Rulot Segovia, Enrique Vidal Ruiz, Francisco Casacuberta Nolla (1984)

Qüestiió

Similarity:

An Isolated Word Recognition System is presented in this paper which uses a parametrization scheme based on the two-level clipped signal Autocorrelation Function. The system prototype runs on a 64 kby. partition of a general-purpose minicomputer with quite small specific hardware requirements and, for moderate sized dictionaries (≤ 40 words), gives 95-98% recognition rates with response times better than two times real time. The system uses claasical Dynamic Programming word-matching,...

Correcting spelling errors by modelling their causes

Sebastian Deorowicz, Marcin Ciura (2005)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper accounts for a new technique of correcting isolated words in typed texts. A language-dependent set of string substitutions reflects the surface form of errors that result from vocabulary incompetence, misspellings, or mistypings. Candidate corrections are formed by applying the substitutions to text words absent from the computer lexicon. A minimal acyclic deterministic finite automaton storing the lexicon allows quick rejection of nonsense corrections, while costs associated...

Noun Sense Disambiguation using Co-Occurrence Relation in Machine Translation

Choe, Changil, Kim, Hyonil (2012)

Serdica Journal of Computing

Similarity:

Word Sense Disambiguation, the process of identifying the meaning of a word in a sentence when the word has multiple meanings, is a critical problem of machine translation. It is generally very difficult to select the correct meaning of a word in a sentence, especially when the syntactical difference between the source and target language is big, e.g., English-Korean machine translation. To achieve a high level of accuracy of noun sense selection in machine translation, we introduced...

How to build billiard words using decimations

Jean-Pierre Borel (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We present two methods based on decimation for computing finite billiard words on any finite alphabet. The first method computes finite billiard words by iteration of some transformation on words. The number of iterations is explicitly bounded. The second one gives a direct formula for the billiard words. Some results remain true for infinite standard Sturmian words, but cannot be used for computation as they only are limit results.

Applying A Normalized Compression Metric To The Measurement Of Dialect Distance

Simov, Kiril, Osenova, Petya (2007)

Serdica Journal of Computing

Similarity:

The paper discusses the application of a similarity metric based on compression to the measurement of the distance among Bulgarian dia- lects. The similarity metric is de ned on the basis of the notion of Kolmo- gorov complexity of a le (or binary string). The application of Kolmogorov complexity in practice is not possible because its calculation over a le is an undecidable problem. Thus, the actual similarity metric is based on a real life compressor which only approximates the Kolmogorov...