GALENA: Tabular DCG Parsing for Natural Languages
نویسندگان
چکیده
We present a deenite clause based parsing environment for natural languages, whose operational model is the dynamic interpretation of logical push-down automata. We attempt to brieey explain our design decisions in terms of a set of properties that practical natural language processing systems should incorporate. The aim is to show both the advantages and the drawbacks of our approach.
منابع مشابه
A Pregroup Toolbox for Parsing and Building Grammars of Natural Languages
Pregroup grammars are a mathematical formalism in the spirit of categorial grammars. They are close to logical formalisms like Lambek calculus but have a polynomial parsing algorithm. The paper presents a pregroup toolbox for parsing and building grammars of natural languages, including a parser that uses a tabular approch based on majority partial composition.
متن کاملParsing Non-Recursive Context-Free Grammars
We consider the problem of parsing non-recursive context-free grammars, i.e., context-free grammars that generate finite languages. In natural language processing, this problem arises in several areas of application, including natural language generation, speech recognition and machine translation. We present two tabular algorithms for parsing of non-recursive context-free grammars, and show th...
متن کاملParsing non-recursive CFGs
We consider the problem of parsing non-recursive context-free grammars, i.e., context-free grammars that generate finite languages. In natural language processing, this problem arises in several areas of application, including natural language generation, speech recognition and machine translation. We present two tabular algorithms for parsing of non-recursive context-free grammars, and show th...
متن کاملSlot Unification Grammar
In this paper we propose a framework which we call Slot Unification Grammar (SUG). This framework allows to integrate different kinds of knowledge, all of them necessary for resolution of several problems in Natural Language Processing (NLP). These problems, such as coordination, extraposition of constituents, ellipsis and anaphora, sometimes occur simultaneously and it is very useful to solve ...
متن کاملA constraint-based bottom-up counterpart to DCG
A new grammar formalism, CHR Grammars (CHRG), is proposed that provides a constraintsolving 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: – An inherent treatment of ambiguity without backtracking. – Robus...
متن کامل