Automatic error correction in flexion languages
type: Item
instance of: scholarly article
title: Automatic error correction in flexion languages
zbMATH Open document ID: 0728.68094
DOI: 10.1007/BF01099203
author: I. A. Bol'shakov
published in: Journal of Soviet Mathematics
publication date: 1991-01-01T00:00:00Z
review text: Review article.
Mathematics Subject Classification ID: 68T50
zbMATH DE Number: 4203748
zbMATH Keywords: flexion languages
zbMATH Keywords: error correction
zbMATH Keywords: text recognition
MaRDI profile type: Publication
cites work: A program for correcting spelling errors
cites work: Space/time trade-offs in hash coding with allowable errors
cites work: Partial match retrieval
cites work: Associative retrieval trie hash-coding
cites work: Representation of a word function as the sum of two functions
cites work: An Algorithm for Finding Best Matches in Logarithmic Expected Time
cites work: Practical syntactic error recovery
cites work: A linear space algorithm for computing maximal common subsequences
cites work: Algorithms for the Longest Common Subsequence Problem
cites work: Computing a longest common subsequence for a set of strings
cites work: New algorithms for the LCS problem
cites work: A fast algorithm for computing longest common subsequences
cites work: Hierarchical file organization and its application to similar-string matching
cites work: Q4772738
cites work: A common basis for similarity measures involving two strings†
cites work: Q4163228
cites work: An Extension of the String-to-String Correction Problem
cites work: Spelling correction in systems programs
cites work: TOLERATING FUZZINESS IN KEYWORDS BY SIMILARITY SEARCHES
cites work: An algorithm for the distance between two finite sequences
cites work: A Simplified Heuristic Version of a Recursive Bayes Algorithm for Using Context in Text Recognition
cites work: A bottom-up and top-down approach to using context in text recognition
cites work: A comparison of three string matching algorithms
cites work: Q5605200
cites work: A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words
cites work: A Shortest Path Algorithm for Edge-Sparse Graphs
cites work: Bounds for the String Editing Problem
Recommended article: Q3704905
Recommended article: Error-detecting properties of languages
Recommended article: Q5503440
Recommended article: Q4841763
Recommended article: Language simplification through error-correcting and grammatical inference techniques
Recommended article: Error-correcting tree language inference
Recommended article: Self-correcting constructions of finite automata
description: scientific article; zbMATH DE number 4203748