Show simple item record

Free Indexation: Combinatorial Analysis and a Compositional Algorithm

dc.date.accessioned2004-10-04T15:14:28Z
dc.date.accessioned2018-11-24T10:14:31Z
dc.date.available2004-10-04T15:14:28Z
dc.date.available2018-11-24T10:14:31Z
dc.date.issued1989-12-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6517
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/6517
dc.description.abstractIn the principles-and-parameters model of language, the principle known as "free indexation'' plays an important part in determining the referential properties of elements such as anaphors and pronominals. This paper addresses two issues. (1) We investigate the combinatorics of free indexation. In particular, we show that free indexation must produce an exponential number of referentially distinct structures. (2) We introduce a compositional free indexation algorithm. We prove that the algorithm is "optimal.'' More precisely, by relating the compositional structure of the formulation to the combinatorial analysis, we show that the algorithm enumerates precisely all possible indexings, without duplicates.en_US
dc.format.extent1355223 bytes
dc.format.extent541415 bytes
dc.language.isoen_US
dc.titleFree Indexation: Combinatorial Analysis and a Compositional Algorithmen_US


Files in this item

FilesSizeFormatView
AIM-1156.pdf541.4Kbapplication/pdfView/Open
AIM-1156.ps1.355Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record