The Open UniversitySkip to content
 

Chart parsing in Prolog

Simpkins, Neil and Hancox, Peter (1990). Chart parsing in Prolog. New Generation Computing, 8(2) pp. 113–138.

DOI (Digital Object Identifier) Link: http://dx.doi.org/10.1007/BF03037470
Google Scholar: Look up in Google Scholar

Abstract

Several differing approaches to parsing using Prolog are discussed and their characteristics outlined, in particular Definite Clause Grammar (DCG), the Bottom-Up Parser (BUP) and the Active Chart Parser. Attention is paid to the conflict that arises between the simplicity and efficiency of the parsing algorithm when using a grammar specified as a linguistic, rather than computationally efficient, description of a sublanguage. A simple and efficient parsing algorithm called ‘Word Incorporation’ is described. Its efficient implementation in Prolog and extensions for handing literals, the Kleene star operator and gaps in grammar rules are described using experience gained with the unification-based formalism, Lexical Functional Grammar (LFG).

Item Type: Journal Article
Copyright Holders: 1990 Ohmsha, Ltd
ISSN: 0288-3635
Academic Unit/Department: Mathematics, Computing and Technology > Computing & Communications
Item ID: 20979
Depositing User: Neil Simpkins
Date Deposited: 06 Apr 2010 09:12
Last Modified: 02 Dec 2010 20:52
URI: http://oro.open.ac.uk/id/eprint/20979
Share this page:

Actions (login may be required)

View Item
Report issue / request change

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340   general-enquiries@open.ac.uk