1999 DeformedFuzzyAutomatafortheText

• (Echanobe et al., 1999) ⇒ Javier Echanobe, Jose Ramon Garitagoitia, and Jose Ramon Gonzalez de Mendivil. (1999). “Deformed Fuzzy Automata for the Text Error Correction Problem.” In: Proceedings of EUSFLAT-ESTYLF Joint Conf. 1999.

Subject Headings: Deformed System, Fuzzy System, Deformed Fuzzy Automaton TEC System.

Notes

• Duplicates & Reprints:
  • (Echanobe et al., 2000) ⇒ Javier Echanobe, Jose Ramon Garitagoitia, and Jose Ramon Gonzalez de Mendivil. (1999). “Deformed Fuzzy Automata for the Text Error Correction Problem.

Cited By

• Google Scholar: 0 Citations ⇒ http://scholar.google.com/scholar?q=%221999%22+Deformed+Fuzzy+Automata+for+the+Text+Error+Correction+Problem Retrieved:2019-07-21
• Semantic Scholar: 0 Citations ⇒ https://www.semanticscholar.org/paper/Deformed-fuzzy-automata-for-the-text-error-problem-Echanobe-Garitagoitia/bbbc61f77c0115ec23938ec95a344ef70ac474cf Retrieved:2019-07-21

Quotes

Abstract

A fuzzy method for the text error correction problem is introduced. The method is able to handle insert, delete and substitution errors. Moreover, it uses the measurement level output that an Isolated Character Classifier can provide. The method is based on a Deformed System, in particular, a deformed fuzzy automaton is defined to model the possible errors in the words of the texts. Experimental results show good performance in correcting the three types of errors.

Introduction

The automatic detection and correction of errors is an important problem in the recognition of texts. Textual errors are mainly caused during the recognition process, and they are known as edition errors: insert, delete or change errors. In text recognition systems, the error correction is in part provided by a Contextual Postprocessing (CP). Let [math]\displaystyle{ w = a_1\;a_2 \cdots a_m }[/math] be an observed word which is obtained from a previous stage of the system; being the characters [math]\displaystyle{ a_i (1 \leq i \leq m) }[/math] belong to an alphabet [math]\displaystyle{ \Sigma }[/math]. The objective of the CP is to estimate a word [math]\displaystyle{ \hat{w} }[/math] in a set of words [math]\displaystyle{ D }[/math] (a dictionary) that is the best selection for [math]\displaystyle{ w }[/math], e.g., it minimizes a certain distance function [math]\displaystyle{ d(\hat{w}, w) }[/math] or maximizes the posteriori probability [math]\displaystyle{ P(\hat{w} | w) }[/math]. This problem is referred to as one of text error correction.

...

== References ==;

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
1999 DeformedFuzzyAutomatafortheText	Javier Echanobe Jose Ramon Garitagoitia Jose Ramon Gonzalez de Mendivil			Deformed Fuzzy Automata for the Text Error Correction Problem						1999