A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
Techniques for accelerating a grammar-checker
1997
Proceedings of the fifth conference on Applied natural language processing -
Preserved Fulltext
The paper describes several possibilities of using finite-state automata a~s means for speeding up the performance of a grammarand-parsing-based (as opposed to patternmatching-based) grammar-checker able to detect errors from a predefined set. The ideas contained have been successflfily implemented in a grammar-checker for Czech, a free-word-order language from the Slavic group.
doi:10.3115/974557.974580
dblp:conf/anlp/Oliva97
fatcat:vm42u2ufrjckznybg67sacuate