Spelling correction in systems programs

DOI10.1145/362007.362033MaRDI QIDQ5578057zbMATH OpenOpenAlexFDO

Authors 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

Cited in

(17)

• New algorithms for the LCS problem
• 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
• The use of context in pattern recognition
• Comparison of strings belonging to the same family
• How hard is computing the edit distance?
• Exact algorithms for the repetition-bounded longest common subsequence problem
• Tight conditional lower bounds for longest common increasing subsequence
• Calcul de la distance par les sous-mots
• TOLERATING FUZZINESS IN KEYWORDS BY SIMILARITY SEARCHES
• Sketching, streaming, and fine-grained complexity of (weighted) LCS
• Tight conditional lower bounds for longest common increasing subsequence
• Input-driven pushdown automata for edit distance neighborhood
• Computing a longest common subsequence for a set of strings
• Automatic error correction in flexion languages
• A model and a fast algorithm for multiple errors spelling correction

This page was built for publication: Spelling correction in systems programs

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