Displaying similar documents to “Noun Sense Disambiguation using Co-Occurrence Relation in Machine Translation”

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

Pipelined language model construction for Polish speech recognition

Jerzy Sas, Andrzej Żołnierek (2013)

International Journal of Applied Mathematics and Computer Science

Similarity:

The aim of works described in this article is to elaborate and experimentally evaluate a consistent method of Language Model (LM) construction for the sake of Polish speech recognition. In the proposed method we tried to take into account the features and specific problems experienced in practical applications of speech recognition in the Polish language, reach inflection, a loose word order and the tendency for short word deletion. The LM is created in five stages. Each successive stage...

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

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