Spelling correction in systems programs

DOI10.1145/362007.362033zbMath0185.43403OpenAlexW2008819433MaRDI QIDQ5578057

Howard Lee Morgan

Publication date: 1970

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/362007.362033

zbMATH Keywords

computer science and automata

Related Items

Exact algorithms for the repetition-bounded longest common subsequence problem ⋮ Calcul de la distance par les sous-mots ⋮ A fast algorithm for the longest-common-subsequence problem ⋮ Automatic correction of syntax-errors in programming languages ⋮ LL(1) grammars supporting an efficient error handling ⋮ TOLERATING FUZZINESS IN KEYWORDS BY SIMILARITY SEARCHES ⋮ Tight conditional lower bounds for longest common increasing subsequence ⋮ Unnamed Item ⋮ The use of context in pattern recognition ⋮ Input-driven pushdown automata for edit distance neighborhood ⋮ Unnamed Item ⋮ Comparison of strings belonging to the same family ⋮ Computing a longest common subsequence for a set of strings ⋮ How hard is computing the edit distance? ⋮ Automatic error correction in flexion languages ⋮ A model and a fast algorithm for multiple errors spelling correction ⋮ New algorithms for the LCS problem