Deductive parsing with multiple levels of representation

Mark Johnson

doi:10.3115/982023.982053

Deductive parsing with multiple levels of representation

Mark Johnson

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

1 Citation (Scopus)

6 Downloads (Pure)

Abstract

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.

Original language	English
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)
Pages	241-248
Number of pages	8
DOIs	https://doi.org/10.3115/982023.982053
Publication status	Published - 1988
Externally published	Yes
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

Conference	Annual Meeting of the Association for Computational Linguistics (26th : 1988)
Country/Territory	United States
City	Buffalo
Period	7/06/88 → 10/06/88

Bibliographical note

Copyright 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.

Access to Document

10.3115/982023.982053

Publisher version (open access)Final published version, 683 KBLicence: CC BY-NC-SA

Cite this

@inproceedings{d26b7a1d626c41359694f64567ac9c37,

title = "Deductive parsing with multiple levels of representation",

abstract = "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.",

author = "Mark Johnson",

note = "Copyright 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. ; Annual Meeting of the Association for Computational Linguistics (26th : 1988) ; Conference date: 07-06-1988 Through 10-06-1988",

year = "1988",

doi = "10.3115/982023.982053",

language = "English",

pages = "241--248",

booktitle = "Proceedings of the 26th Annual Meeting of the Association for Computational Linguistics",

publisher = "Association for Computational Linguistics (ACL)",

}

Johnson, M 1988, Deductive parsing with multiple levels of representation. in Proceedings of the 26th Annual Meeting of the Association for Computational Linguistics. Association for Computational Linguistics (ACL), Morristown, NJ, pp. 241-248, Annual Meeting of the Association for Computational Linguistics (26th : 1988), Buffalo, New York, United States, 7/06/88. https://doi.org/10.3115/982023.982053

TY - GEN

T1 - Deductive parsing with multiple levels of representation

AU - Johnson, Mark

N1 - Copyright 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.

PY - 1988

Y1 - 1988

N2 - 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.

AB - 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.

U2 - 10.3115/982023.982053

DO - 10.3115/982023.982053

M3 - Conference proceeding contribution

SP - 241

EP - 248

BT - Proceedings of the 26th Annual Meeting of the Association for Computational Linguistics

PB - Association for Computational Linguistics (ACL)

CY - Morristown, NJ

T2 - Annual Meeting of the Association for Computational Linguistics (26th : 1988)

Y2 - 7 June 1988 through 10 June 1988

ER -

Deductive parsing with multiple levels of representation

Abstract

Conference

Bibliographical note

Access to Document

Fingerprint

Cite this