Techniques for accelerating a grammar-checker

Abstract

The paper describes several possibilities of using finite-state automata as means for speeding up the performance of a grammar- and-parsing-based (as opposed to pattern-matching-based) grammar-checker able to detect errors from a predefined set. The ideas contained have been successfully implemented in a grammar-checker for Czech, a free-word-order language from the Slavic group.