Description Based Parsing in a Connectionist Network
| dc.contributor.author | Henderson, James | |
| dc.date | 2023-05-16T23:50:25.000 | |
| dc.date.accessioned | 2023-05-22T19:57:48Z | |
| dc.date.available | 2023-05-22T19:57:48Z | |
| dc.date.issued | 1994-09-01 | |
| dc.date.submitted | 2006-09-11T11:08:58-07:00 | |
| dc.description.abstract | Recent developments in connectionist architectures for symbolic computation have made it possible to investigate parsing in a connectionist network while still taking advantage of the large body of work on parsing in symbolic frameworks. This dissertation investigates syntactic parsing in the temporal synchrony variable binding model of symbolic computation in a connectionist network. This computational architecture solves the basic problem with previous connectionist architectures, while keeping their advantages. However, the architecture does have some limitations, which impose computational constraints on parsing in this architecture. This dissertation argues that, despite these constraints, the architecture is computationally adequate for syntactic parsing and that these constraints make significant linguistic predictions. To make these arguments, the nature of the architecture's limitations are first characterized as a set of constraints on symbolic computation. This allows the investigation of the feasibility and implications of parsing in the architecture to be investigated at the same level of abstraction as virtually all other investigations of syntactic parsing. Then a specific parsing model is developed and implemented in the architecture. The extensive use of partial descriptions of phrase structure trees is crucial to the ability of this model to recover the syntactic structure of sentences within the constraints. Finally, this parsing model is tested on those phenomena which are of particular concern given the constraints, and on an approximately unbiased sample of sentences to check for unforeseen difficulties. The results show that this connectionist architecture is powerful enough for syntactic parsing. They also show that some linguistic phenomena are predicted by the limitations of this architecture. In particular, explanations are given for many cases of unacceptable center embedding, and for several significant constraints on long distance dependencies. These results give evidence for the cognitive significance of this computational architecture and parsing model. This work also shows how the advantages of both connectionist and symbolic techniques can be unified in natural language processing applications. By analyzing how low level biological and computational considerations influence higher level processing, this work has furthered our understanding of the nature of language and how it can be efficiently and effectively processed. | |
| dc.description.comments | University of Pennsylvania Institute for Research in Cognitive Science Technical Report No. IRCS-94-12. | |
| dc.identifier.uri | https://repository.upenn.edu/handle/20.500.14332/37573 | |
| dc.legacy.articleid | 1158 | |
| dc.legacy.fulltexturl | https://repository.upenn.edu/cgi/viewcontent.cgi?article=1158&context=ircs_reports&unstamped=1 | |
| dc.source.issue | 158 | |
| dc.source.journal | IRCS Technical Reports Series | |
| dc.source.status | published | |
| dc.title | Description Based Parsing in a Connectionist Network | |
| dc.type | Dissertation/Thesis | |
| digcom.contributor.author | Henderson, James | |
| digcom.identifier | ircs_reports/158 | |
| digcom.identifier.contextkey | 204197 | |
| digcom.identifier.submissionpath | ircs_reports/158 | |
| digcom.type | thesis | |
| dspace.entity.type | Publication | |
| upenn.schoolDepartmentCenter | IRCS Technical Reports Series |
Files
Original bundle
1 - 1 of 1