Displaying similar documents to “Some variants of Hausdorff distance for word matching”

Hausdorff Distances for Searching in Binary Text Images

Andreev, Andrey, Kirov, Nikolay (2009)

Serdica Journal of Computing

Similarity:

This work has been partially supported by Grant No. DO 02-275, 16.12.2008, Bulgarian NSF, Ministry of Education and Science. Hausdorff distance (HD) seems the most efficient instrument for measuring how far two compact non-empty subsets of a metric space are from each other. This paper considers the possibilities provided by HD and some of its modifications used recently by many authors for resemblance between binary text images. Summarizing part of the existing word image 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...

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,...

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.

Directive words of episturmian words: equivalences and normalization

Amy Glen, Florence Levé, Gwénaël Richomme (2008)

RAIRO - Theoretical Informatics and Applications

Similarity:

Episturmian morphisms constitute a powerful tool to study episturmian words. Indeed, any episturmian word can be infinitely decomposed over the set of pure episturmian morphisms. Thus, an episturmian word can be defined by one of its morphic decompositions or, equivalently, by a certain directive word. Here we characterize pairs of words directing the same episturmian word. We also propose a way to uniquely define any episturmian word through a normalization of its directive words....

On some problems related to palindrome closure

Michelangelo Bucci, Aldo de Luca, Alessandro De Luca, Luca Q. Zamboni (2008)

RAIRO - Theoretical Informatics and Applications

Similarity:

In this paper, we solve some open problems related to (pseudo)palindrome closure operators and to the infinite words generated by their iteration, that is, standard episturmian and pseudostandard words. We show that if is an involutory antimorphism of , then the right and left -palindromic closures of any factor of a -standard word are also factors of some -standard word. We also introduce the class of pseudostandard words with “seed”, obtained by iterated pseudopalindrome closure...