Automatic error correction in flexion languages

DOI10.1007/BF01099203MaRDI QIDQ805262zbMATH OpenFDO

Authors I. A. Bol'shakov

Publication date 1991

Published in Journal of Soviet Mathematics (Search for Journal in Brave)

zbMATH Keywords

error correctionflexion languagestext recognition

Mathematics Subject Classification ID

Natural language processing (68T50)

Recommendations

• scientific article; zbMATH DE number 3932411
• Error-detecting properties of languages
• Maximal error-detecting capabilities of formal languages
• scientific article; zbMATH DE number 778420
• Language simplification through error-correcting and grammatical inference techniques
• Error-correcting tree language inference
• Self-correcting constructions of finite automata

Cites work

• scientific article; zbMATH DE number 3596850 (Why is no real title available?)
• scientific article; zbMATH DE number 3448107 (Why is no real title available?)
• scientific article; zbMATH DE number 3326418 (Why is no real title available?)
• A Shortest Path Algorithm for Edge-Sparse Graphs
• A Simplified Heuristic Version of a Recursive Bayes Algorithm for Using Context in Text Recognition
• A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words
• A bottom-up and top-down approach to using context in text recognition
• A common basis for similarity measures involving two strings†
• A comparison of three string matching algorithms
• A fast algorithm for computing longest common subsequences
• A linear space algorithm for computing maximal common subsequences
• A program for correcting spelling errors
• Algorithms for the Longest Common Subsequence Problem
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• An Extension of the String-to-String Correction Problem
• An algorithm for the distance between two finite sequences
• Associative retrieval trie hash-coding
• Bounds for the String Editing Problem
• Computing a longest common subsequence for a set of strings
• Hierarchical file organization and its application to similar-string matching
• New algorithms for the LCS problem
• Partial match retrieval
• Practical syntactic error recovery
• Representation of a word function as the sum of two functions
• Space/time trade-offs in hash coding with allowable errors
• Spelling correction in systems programs
• TOLERATING FUZZINESS IN KEYWORDS BY SIMILARITY SEARCHES

Cited in

(1)

• Language simplification through error-correcting and grammatical inference techniques

This page was built for publication: Automatic error correction in flexion languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805262)