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).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Pereira, F. C. N. and Warren, D. H. D., “Definite Clause Grammars for Language Analysis: a Survey of the Formalism and a Comparison with Augmented Transition Networks,”Artificial Intelligence, 13 pp. 231–278, 1980.
McCord, M. C., “Modular Logic Grammars”,Proc. of the 23rd Ann. Meet. ACL, Chicago, 8–12 July 1985, ACL, pp. 104–117, 1985.
Frey, W. and Reyle, U., “A Prolog Implementation of Lexical Functional Grammar,”Proc. of the 8th IJCAI, Karlsruhe, 1, IJCAI, pp. 693–695, 1983.
Eisele, A., “A Lexical Functional Grammar System in Prolog,”Working Paper, Dept. of Linguistics, University of Stuttgart, 1984.
Matsumoto, Y., Tanaka, H., Hirakawa, H., Miyoshi, H. and Yasukawa, H., “BUP: A Bottom-Up Parser Embedded in Prolog,”New Generation Computing, 1, pp. 145–158, 1983.
Kaplan, R. M. and Bresnan, J., “Lexical Functional Grammar: a Formal System for Grammatical Representation,” inThe Mental Representation of Grammatical Relations (J. Bresnan, ed.), MIT Press, pp. 173–281, 1982.
Winograd, T.,Language as a Cognitive Process: Vol. 1, Syntax, Addison-Wesley, 1983.
Phillips, J. D., “A Simple Efficient Parser for Phrase-Structure Grammars,”AISB Quarterly, 59, pp. 14–17, 1987.
Phillips, J. D. and Thompson, H. S., “A Parser for Generalised Phrase-Structure Grammars,” inWorking Papers in Cognitive Science: Vol. 1, Categorial Grammar, Unification Grammar and Parsing (N. Haddock, E. Klein and G. Morrill, eds.), Centre for Cognitive Science, University of Edinburgh, pp. 115–136, 1987.
Matsumoto, Y., “A Parallel Parsing System for Natural Language Analysis,” in3rd Int. Conf. of Logic Programming (E. Shapiro, ed.), Springer-Verlag, pp. 396–409, 1986.
Trehan, R. and Wilk, P. F., “A Parallel Chart Parser for the Committed Choice Non-Deterministic Logic Languages,” inProc. of the Fifth Int. Conf. on Logic Programing (R. A. Kowalski and K. A. Bowen, eds.), MIT Press, pp. 212–232, 1988.
Dahl, V. and Abramson, H., “On Grapping Grammars,”Proc. of 2nd Int. Conf. on Logic Programming, Uppsala, pp. 77–99, 1984.
Dahl, V., “More on Gapping Grammars,”Proc. of the Int. Conf. on Fifth Generation Computer Systems, Japan, pp. 669–677, 1984.
Author information
Authors and Affiliations
About this article
Cite this article
Simpkins, N.K., Hancox, P. Chart parsing in Prolog. New Gener Comput 8, 113–138 (1990). https://doi.org/10.1007/BF03037470
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF03037470