2004 · 12 citations · 17 references
This article describes the construction and performance of Granska – a surface-oriented system for grammar checking of Swedish text. With the use of carefully constructed error detection rules, written in a new structured rule language, the system can detect and suggest corrections for a number of grammatical errors in Swedish texts. In this article, we specifically focus on how erroneously split compounds and disagreement are handled in the rules. The system combines probabilistic and rule-based methods to achieve high efficiency and robustness. The error detection rules are optimized using statistics of part-of-speech bigrams and words in a way that each rule needs to be checked as seldom as possible. We have found that the Granska system with higher efficiency can achieve the same or better results than systems with conventional technology.
17
The elements of computer credibility
B. J. Fogg, Hsiang Li Tseng · 1999 · 784 citations
New Conceptual Frameworks, Engineering, Information Security +20
A Winnow-Based Approach to Context-Sensitive Spelling Correction
Andrew R. Golding, Dan Roth · Machine Learning · 1999 · 280 citations
Constraint grammar as a framework for parsing running text
Fred Karlsson · 1990 · 206 citations · Full text
Equations for part-of-speech tagging
Eugene Charniak, Curtis Hendrickson, Neil G. Jacobson et al. · 1993 · 169 citations
Automatic Rule Acquisition for Spelling Correction
Lidia Mangu, Eric Brill · 1997 · 123 citations