This paper discusses a sequence of deductive parsers, called PAD1 - PAD5, that utilize an axiomatization of the principles and parameters of GB theory, including a restricted transformational component (Move-α). PAD2 uses an inference control strategy based on the 'freeze' predicate of Prolog-II, while PAD3 - 5 utilize the Unfold-Fold transformation to transform the original axiomatization into a form that functions as a recursive descent Prolog parser for the fragment.
|Title of host publication||Proceedings of the 26th Annual Meeting of the Association for Computational Linguistics|
|Place of Publication||Morristown, NJ|
|Publisher||Association for Computational Linguistics (ACL)|
|Number of pages||8|
|Publication status||Published - 1988|
|Event||Annual Meeting of the Association for Computational Linguistics (26th : 1988) - State University of New York at Buffalo, Buffalo, United States|
Duration: 7 Jun 1988 → 10 Jun 1988
|Conference||Annual Meeting of the Association for Computational Linguistics (26th : 1988)|
|Period||7/06/88 → 10/06/88|
Bibliographical noteCopyright the Publisher 1988. Version archived for private and non-commercial use with the permission of the author/s and according to publisher conditions. For further rights please contact the publisher.
Johnson, M. (1988). Deductive parsing with multiple levels of representation. In Proceedings of the 26th Annual Meeting of the Association for Computational Linguistics (pp. 241-248). Morristown, NJ: Association for Computational Linguistics (ACL). https://doi.org/10.3115/982023.982053