A constraint-based bottom-up counterpart to definite clause grammars

    Research output: Chapter in Book/Report/Conference proceedingBook chapterResearch


    A new grammar formalism, CHR Grammars (CHRG), is proposed that provides a constraint-solving approach to language analysis, built on top of the programming language of Constraint Handling Rules in the same way as Definite Clause Grammars (DCG) on Prolog. CHRG works bottom-up and adds the following features when compared with DCG: (i) An inherent treatment of ambiguity without backtracking. (ii) Robust parsing; do not give up in case of errors but return the recognized phrases. (iii)~A flexibility to produce and consume arbitrary hypotheses making it straight\-forward to deal with abduction, integrity constraints, operators a la assumption grammars, and to incorporate other constraint solvers. (iv)~Context-sensitive rules that apply for disambiguation, coordination in natural language and tagger-like rules.
    Original languageEnglish
    Title of host publicationRecent Advances in Natural Language Processing III, Selected papers from RANLP 2003
    EditorsNicolas Nicolov, Ruslan Mitkov, Galia Angelova, Kalina Bontcheva
    Place of PublicationAmsterdam/Philadelphia
    PublisherJohn Benjamins Publishing Company
    Publication date2004
    ISBN (Print)1 58811 618 2 / 90 272 4774 9
    Publication statusPublished - 2004

    Cite this