A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words

DOI10.1093/comjnl/20.2.141zbMath0359.68121OpenAlexW2023358833MaRDI QIDQ4131721

Publication date: 1977

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/20.2.141

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (7)

Partition search for non-binary constraint satisfaction ⋮ Fast Approximate Search in Large Dictionaries ⋮ Relational consistency algorithms and their application in finding subgraph and graph isomorphisms ⋮ STR2: optimized simple tabular reduction for table constraints ⋮ An approximate string-matching algorithm ⋮ A comparison of a novel neural spell checker and standard spell checking algorithms ⋮ Automatic error correction in flexion languages

This page was built for publication: A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words