HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

A Grammar Correction Algorithm – Deep Parsing and Minimal Corrections for a Grammar Checker

Lionel Clément 1, 2 Kim Gerdes 3, * Renaud Marlet 1, 2
* Corresponding author
1 SIGNES - Linguistic signs, grammar and meaning: computational logic for natural language
CNRS - Centre National de la Recherche Scientifique : UMR5800, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Inria Bordeaux - Sud-Ouest, Université Sciences et Technologies - Bordeaux 1
Abstract : This article presents the central algorithm of an open system for grammar checking, based on deep parsing. The grammatical specification is a context-free grammar with flat feature structures. After a shared-forest analysis where feature agreement constraints are relaxed, error detection globally minimizes the number of corrections and alternative correct sentences are automatically proposed in an order of plausibility reflecting the number of changes made to the original sentence.
Document type :
Conference papers
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download

Contributor : Renaud Marlet Connect in order to contact the contributor
Submitted on : Monday, July 27, 2009 - 5:41:35 PM
Last modification on : Monday, December 20, 2021 - 4:50:11 PM
Long-term archiving on: : Monday, October 15, 2012 - 12:31:02 PM


Files produced by the author(s)


  • HAL Id : inria-00396240, version 1



Lionel Clément, Kim Gerdes, Renaud Marlet. A Grammar Correction Algorithm – Deep Parsing and Minimal Corrections for a Grammar Checker. 14th conference on Formal Grammar (FG 2009), Jul 2009, Bordeaux, France. ⟨inria-00396240⟩



Record views


Files downloads