Abstract
This paper reports on the development of a finite state system for finding grammar errors without actually specifying the error.A corpus of Swedish text written by children served as the data.Errors are more frequent and the distribution of the error types is different than for adult writers.Our approach (following Karttunen et al.[9 ]for finding errors involves developing automata that represent two “positive ” grammars with varying degree of detail and then subtracting the detailed one from the general one.The difference between the automata corresponds to a grammar for errors.We use a robust parsing strategy which first identi fies the lexical head of a phrase together with the lexical string which precedes it beginning at the left margin of the phrase.The technique shows good coverage results for agreement and verb selection phenomena.In future,we aim to include also the detection of agreement between subject and predicative complements,word order phenomena and missing sentence boundaries.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ait-Mohtar, Salah and Chanod, Jean-Pierre (1997)Incremental Finite-State Parsing,In ANLP’ 97,Washington,pp.72–79.
Arppe, Antti (2000)Developing a Grammar Checker for Swedish.The 12th Nordic Conference of Computational Linguistics,1999.
Birn, Juhani (2000)Detecting Grammar Errors with Lingsoft’s Swedish Grammar Checker.The 12th Nordic Conference of Computational Linguistics,1999.
Bustamente, Flora Ramírez and León, Fernando Sánchez (1996)GramCheck:A Grammar and Style Checker.In the 16th International Conference on Computational Linguistics,Copenhagen pp.175–181.
Carlberger, Johan and Domeij, Rickard and Kann, Viggo and Knutsson Ola (2000) A Swedish Grammar Checker.Association for Computational Linguistics.
Chanod, Jean-Pierre (1996)A Broad-Coverage French Grammar Checker:Some Underlying Principles.In the Sixth International Conference on Symbolic and Logical Computing,Dakota State University Madison,South Dakota.
Ejerhed, E. and Källgren, G. and Wennstedt, O. and Åström,M.(1992)The Linguistic Annotation System of the Stockholm-Umeå Corpus Project.Report 33. University of Umeå,Department of Linguistics.
Karttunen, Lauri (1993)Finite State Lexicon Compiler.Technical Report ISTL-NLTT-1993-04-02,Xerox Palo Alto Research Center, Palo Alto,California.
Karttunen, Lauri, Chanod, Jean-Pierre, Grefenstette, Gregory and Schiller, Anne (1996)Regular Expressions for Language Engineering,In Natural Language Engineering 2 (4)305–328.
Karttunen, Lauri and Gaál, Tamás and Kempe, André (1997)Xerox Finite-State Tool.Xerox Research Centre Europe, Grenoble,Maylan,France.
Kirschner, Zdenek (1994)CZECKER-a Maquette Grammar-Checker for Czech. In The Prague Bulletin of Mathematical Linguistics 62,Praha: Universita Karlova.
Sågvall Hein, Anna (1998)A Chart-Based Framework for Grammar Checking: Initial Studies.The 11th Nordic Conference of Computational Linguistics,1998.
Skolverket (1992)LEXIN:språklexikon f ör invandrare.Nordsteds Förlag.
Tapanainen, Pasi (1997)Applying a Finite State Intersection Grammar.In Roche, Emmanuel and Schabes, Yves (eds.)Finite State Language Processing,MIT Press.
Vosse, Theodorus Gregorius (1994)The Word Connection.Grammar-based Spelling Error Correction in Dutch.Enschede: Neslia Paniculata.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hashemi, S.S., Cooper, R., Andersson, R. (2003). Positive Grammar Checking:A Finite State Approach. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2003. Lecture Notes in Computer Science, vol 2588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36456-0_71
Download citation
DOI: https://doi.org/10.1007/3-540-36456-0_71
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00532-2
Online ISBN: 978-3-540-36456-6
eBook Packages: Springer Book Archive