Show simple item record

Defining Natural Language Grammars in GPSG

dc.date.accessioned2004-10-04T14:56:34Z
dc.date.accessioned2018-11-24T10:13:45Z
dc.date.available2004-10-04T14:56:34Z
dc.date.available2018-11-24T10:13:45Z
dc.date.issued1986-04-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6447
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/6447
dc.description.abstractThis paper is a formal analysis of whether generalized phrase structure grammar's (GPSG) weak context-free generative power will allow it to achieve three of its central goals: (1) to characterize all and only the natural language grammars, (2) to algorithmically determine membership and generative power consequences of GPSG's and (3) to embody the universalism of natural language entirely in the formal system. I prove that "=E*?" is undecidable for GPSGs and, on the basis of this result and the unnaturalness of E*, I argue that GPSG's three goals and its weak context-free generative power conflict with each other: there is no algorithmic way of knowing whether any given GPSG generates a natural language or an unnatural one. The paper concludes with a diagnosis of the result and suggests that the problem might be met by abandoning the weak context-free framework and assuming substantive constraints.en_US
dc.format.extent1619510 bytes
dc.format.extent644622 bytes
dc.language.isoen_US
dc.titleDefining Natural Language Grammars in GPSGen_US


Files in this item

FilesSizeFormatView
AIM-895.pdf644.6Kbapplication/pdfView/Open
AIM-895.ps1.619Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record