CHR grammars

    Research output: Contribution to journalJournal articleResearchpeer-review

    Abstract

    A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena. The formalism extends previous logic programming based grammars with a form of context-sensitive rules and the possibility to include extra-grammatical hypotheses in both head and body of grammar rules. Among the applications are straightforward implementations of Assumption Grammars and abduction under integrity constraints for language analysis. CHR grammars appear as a powerful tool for specification and implementation of language processors and may be proposed as a new standard for bottom-up grammars in logic programming.
    A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena. The formalism extends previous logic programming based grammars with a form of context-sensitive rules and the possibility to include extra-grammatical hypotheses in both head and body of grammar rules. Among the applications are straightforward implementations of Assumption Grammars and abduction under integrity constraints for language analysis. CHR grammars appear as a powerful tool for specification and implementation of language processors and may be proposed as a new standard for bottom-up grammars in logic programming.
    LanguageEnglish
    JournalTheory and Practice of Logic Programming
    Volume4 & 5
    Pages467-501
    ISSN1471-0684
    StatePublished - 2005

    Keywords

    • constraint logic programming
    • Constraint Handling Rules
    • logic grammars

    Cite this

    @article{c58a66c052bd11dba4bc000ea68e967b,
    title = "CHR grammars",
    abstract = "A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena. The formalism extends previous logic programming based grammars with a form of context-sensitive rules and the possibility to include extra-grammatical hypotheses in both head and body of grammar rules. Among the applications are straightforward implementations of Assumption Grammars and abduction under integrity constraints for language analysis. CHR grammars appear as a powerful tool for specification and implementation of language processors and may be proposed as a new standard for bottom-up grammars in logic programming.",
    keywords = "constraint logic programming, Constraint Handling Rules, logic grammars",
    author = "Henning Christiansen",
    year = "2005",
    language = "English",
    volume = "4 & 5",
    pages = "467--501",
    journal = "Theory and Practice of Logic Programming",
    issn = "1471-0684",
    publisher = "Cambridge University Press",

    }

    CHR grammars. / Christiansen, Henning.

    In: Theory and Practice of Logic Programming, Vol. 4 & 5, 2005, p. 467-501.

    Research output: Contribution to journalJournal articleResearchpeer-review

    TY - JOUR

    T1 - CHR grammars

    AU - Christiansen,Henning

    PY - 2005

    Y1 - 2005

    N2 - A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena. The formalism extends previous logic programming based grammars with a form of context-sensitive rules and the possibility to include extra-grammatical hypotheses in both head and body of grammar rules. Among the applications are straightforward implementations of Assumption Grammars and abduction under integrity constraints for language analysis. CHR grammars appear as a powerful tool for specification and implementation of language processors and may be proposed as a new standard for bottom-up grammars in logic programming.

    AB - A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena. The formalism extends previous logic programming based grammars with a form of context-sensitive rules and the possibility to include extra-grammatical hypotheses in both head and body of grammar rules. Among the applications are straightforward implementations of Assumption Grammars and abduction under integrity constraints for language analysis. CHR grammars appear as a powerful tool for specification and implementation of language processors and may be proposed as a new standard for bottom-up grammars in logic programming.

    KW - constraint logic programming

    KW - Constraint Handling Rules

    KW - logic grammars

    M3 - Journal article

    VL - 4 & 5

    SP - 467

    EP - 501

    JO - Theory and Practice of Logic Programming

    T2 - Theory and Practice of Logic Programming

    JF - Theory and Practice of Logic Programming

    SN - 1471-0684

    ER -