Skip to main navigation Skip to search Skip to main content

A grammar correction algorithm: Deep parsing and minimal corrections for a grammar checker

  • SCRIME - LaBRI, Université Bordeaux 1
  • LPP

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationFormal Grammar - 14th International Conference, FG 2009, Revised Selected Papers
Pages47-63
Number of pages17
DOIs
Publication statusPublished - 14 Apr 2011
Externally publishedYes
Event14th International Conference on Formal Grammar, FG 2009 - Bordeaux, France
Duration: 25 Jul 200926 Jul 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5591 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Conference on Formal Grammar, FG 2009
Country/TerritoryFrance
CityBordeaux
Period25/07/0926/07/09

Fingerprint

Dive into the research topics of 'A grammar correction algorithm: Deep parsing and minimal corrections for a grammar checker'. Together they form a unique fingerprint.

Cite this