Implementing a Definite Clause Grammar for Parsing Surface Syntax

1989 ◽  
Author(s):  
Jr. Gurney ◽  
Claffy John O. ◽  
Elbaum Kimberly C. ◽  
Jason H.
Keyword(s):  
Definite Clause Grammar ◽  
Definite Clause

scholarly journals Montagovian Definite Clause Grammar

1985 ◽  
Author(s):  
R. I. Bainbridge
Keyword(s):  
Definite Clause Grammar ◽  
Definite Clause

Extending Definite Clause Grammar to handle flexible word order

1992 ◽  
pp. 161-170
Author(s):  
Vladimir PERICLIEV ◽  
Alexander GRIGOROV
Keyword(s):  
Word Order ◽  
Definite Clause Grammar ◽  
Definite Clause

scholarly journals Multi-Modal Definite Clause Grammar

1994 ◽  
Author(s):  
Hideo Shimazu ◽  
Seigo Arita ◽  
Yosuke Takashima
Keyword(s):  
Definite Clause Grammar ◽  
Definite Clause

Multimodal definite clause grammar

1995 ◽  
Vol 26 (3) ◽  
pp. 93-102 ◽  
Author(s):  
Hideo Shimazu ◽  
Yosuke Takashima
Keyword(s):  
Definite Clause Grammar ◽  
Definite Clause

scholarly journals Implementing A Subcategorized Probabilistic Definite Clause Grammar for Vietnamese Sentence Parsing

2013 ◽  
Vol 2 (4) ◽  
pp. 1-19
Author(s):  
Dang Tuan Nguyen ◽  
Kiet Van Nguyen ◽  
Tin Trung Pham
Keyword(s):  
Definite Clause Grammar ◽  
Sentence Parsing ◽  
Definite Clause

scholarly journals A Prolog-based approach to Arabic syntax and semantics

2021 ◽  
Vol 9 (3A) ◽  
Author(s):  
Salah Alnajem ◽  
◽  
A. M. Mutawa ◽  
Hanan AlMeer ◽  
Aseel AlQemlas ◽  
...  
Keyword(s):  
Syntactic Structure ◽  
Semantic Networks ◽  
Computational Approach ◽  
Computational Semantics ◽  
Functional Grammar ◽  
Lexical Functional Grammar ◽  
Definite Clause Grammar ◽  
Definite Clause

This paper introduces a computational approach to Arabic syntax. The approach uses the Lexical Functional Grammar (LFG) framework. Semantic networks and frames were used to handle computational semantics using lambda notation. This was implemented in Prolog using Definite Clause Grammar (DCG) as a formalism for analyzing and generating syntactic structure.

A useful extension to Prolog's definite clause grammar notation

1989 ◽  
Vol 24 (11) ◽  
pp. 132-134 ◽  
Author(s):  
P. Van Roy
Keyword(s):  
Definite Clause Grammar ◽  
Definite Clause

CHR grammars

2005 ◽  
Vol 5 (4-5) ◽  
pp. 467-501 ◽  
Author(s):  
HENNING CHRISTIANSEN
Keyword(s):  
Logic Programming ◽  
Integrity Constraints ◽  
Bottom Up ◽  
Context Sensitive ◽  
Language Analysis ◽  
Definite Clause Grammars ◽  
Grammar Rules ◽  
High Flexibility ◽  
Definite Clause ◽  
Specification And Implementation

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.

Sign in / Sign up

Export Citation Format

Share Document