Abstract
Slot Grammar makes it easier to write practical, broad-coverage natural language grammars, for the following reasons. (a) The system has a lexicalist character; although there are grammar rules, they are fewer in number and simpler because analysis is largely data-driven — through use of slots taken from lexical entries. (b) There is a modular treatment of different grammatical phenomena through different rule types, for instance rule types for expressing linear ordering constraints. This modularity also reduces the differences between the Slot Grammars of different languages. (c) Several grammatical phenomena, such as coordination and extraposition, are treated mainly in a language-independent shell provided with the system.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bernth, A. [1989] “Discourse Understanding In Logic,” Proc. North American Conference on Logic Programming, pp. 755–771, MIT Press.
Bernth, A. [1990] “Treatment of Anaphoric Problems in Referentially Opaque Contexts,” these Proceedings.
Byrd; R. J. [1983] “Word Formation in Natural Language Processing Systems,” Proceedings of IJCAI-VIII, pp. 704–706.
Colmerauer, A. [1978] “Metamorphosis Grammars,” in L. Bolc (Ed.), Natural Language Communication with Computers, Springer-Verlag.
Heidorn, G. E. [1982] “Experience with an Easily Computed Metric for Ranking Alternative Parses,” Proceedings of Annual ACL Meeting, 1982, pp. 82–84.
Jensen, K. and Heidorn, G. E. [1982] “The Fitted Parse: 100% Parsing Capability in a Syntactic Grammar of English,” Research Report RC 9729, IBM Research Division, Yorktown Heights, NY 10598.
Klavans, J. L. and Wacholder, N. [1989] “Documentation of Features and Attributes in UDICT,” Research Report RC14251, IBM T.J. Watson Research Center, Yorktown Heights, N.Y.
Lappin, S. and McCord, M. C. [1989] “A Syntactic Filter on Pronominal Anaphora for Slot Grammar,” to appear in the Proceedings of ACL 90.
McCord, M.C. [1980] “Slot Grammars,” Computational Linguistics, vol. 6, pp. 31–43.
McCord, M. C. [1982] “Using Slots and Modifiers in Logic Grammars for Natural Language,” Artificial Intelligence, vol. 18, pp. 327–367.
McCord, M. C. [1985] “Modular Logic Grammars,” Proc. 23rd Annual Meeting of the Association for Computational Linguistics, pp. 104–117, Chicago.
McCord, M. C. [1986] “Design of a Prolog-based Machine Translation System,” Proc. of the Third International Logic Programming Conference, pp. 350–374, Springer-Verlag, Berlin.
McCord, M. C. [1987] “Natural Language Processing in Prolog,” in Walker et al. [1987].
McCord, M. C. [1988] “A Multi-Target Machine Translation System,” Proceedings of the International Conference on Fifth Generation Computer Systems 1988, pp. 1141–1149, Institute for New Generation Computer Technology, Tokyo, Japan.
McCord, M. C. [1989a] “Design of LMT: A Prolog-based Machine Translation System,” Computational Linguistics, vol. 15, pp. 33–52.
McCord, M. C. [1989b] “A New Version of Slot Grammar,” Research Report RC 14506, IBM Research Division, Yorktown Heights, NY 10598.
McCord, M. C. [1989c] “A New Version of the Machine Translation System LMT,” J. Literary and Linguistic Computing, vol. 4, pp. 218–229.
McCord, M. C. [1989d] “LMT,” Proceedings of MT Summit II, pp. 94–99, Deutsche Gesellschaft für Dokumentation, Frankfurt.
McCord, M. C. and Wolff, S. [1988] “The Lexicon and Morphology for LMT, a Prolog-based MT system,” Research Report RC 13403, IBM Research Division, Yorktown Heights, NY 10598.
Neff, M. S. and Boguraev, B. K. [1989] “Dictionaries, Dictionary Grammars and Dictionary Entry Parsing,” Proceedings of the 27th Annual Meeting of the ACL, Vancouver, B.C., June, 1989, pp. 91–101.
Neff, M. S. and McCord, M. C. [1990] “Acquiring Lexical Data from Machine-Readable Dictionary Resources for Machine Translation,” IBM Natural Language Processing ITL, Paris, 1990.
Shieber, S. M. [1986] An Introduction to Unification-Based Approaches to Grammar, CSLI Lecture Notes No. 4, Center for the Study of Language and Information, Stanford, CA.
Walker, A. (Ed.), McCord, M., Sowa, J. F., and Wilson, W. G. [1987] Knowledge Systems and Prolog: A Logical Approach to Expert Systems and Natural Language Processing, Addison-Wesley, Reading, Mass.
Wilks, Y., Huang, X-M., and Fass, D. [1985] “Syntax, Preference and Right-Attachment,” Proc. 9th International Joint Conference on Artificial Intelligence, Los Angeles, pp. 779–784.
Woods, W. A. [1973] “An Experimental Parsing System for Transition Network Grammars,” in R. Rustin, Natural Language Processing, pp. 111–154, Algorithmics Press, New York.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McCord, M.C. (1990). Slot Grammar. In: Studer, R. (eds) Natural Language and Logic. Lecture Notes in Computer Science, vol 459. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53082-7_20
Download citation
DOI: https://doi.org/10.1007/3-540-53082-7_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53082-4
Online ISBN: 978-3-540-46653-6
eBook Packages: Springer Book Archive