On Descriptive Complexity, Language Complexity, and GB

dc.contributor.authorRogers, James
dc.date2023-05-16T23:49:39.000
dc.date.accessioned2023-05-22T19:57:34Z
dc.date.available2023-05-22T19:57:34Z
dc.date.issued1995-05-01
dc.date.submitted2006-09-07T10:42:08-07:00
dc.description.abstractWe introduce L2K,P, a monadic second-order language for reasoning about trees which characterizes the strongly Context-Free Languages in the sense that a set of finite trees is definable in L2K,P, if it is (modulo a projection) a Local Set-the set of derivation trees generated by a CFG. This provides a flexible approach to establishing language-theoretic complexity results for formalisms that are based on systems of well-formedness constraints on trees. We demonstrate this technique by sketching two such results for Government and Binding Theory. First, we show that free-indexation, the mechanism assumed to mediate a variety of agreement and binding relationships in GB, is not definable in L2K,P, and therefore not enforceable by CFGs. Second, we show how, in spite of this limitation, a reasonably complete GB account of English can be defined in L2K,P. Consequently, the language licensed by that account is strongly context-free. We illustrate some of the issues involved in establishing this result by looking at the definition, L2K,P, of chains. The limitations of this definition provide some insight into the types of natural linguistic principles that correspond to higher levels of language complexity. We close with some speculation on the possible significance of these results for generative linguistics.
dc.description.commentsUniversity of Pennsylvania Institute for Research in Cognitive Science Technical Report No. IRCS-95-14.
dc.identifier.urihttps://repository.upenn.edu/handle/20.500.14332/37541
dc.legacy.articleid1131
dc.legacy.fulltexturlhttps://repository.upenn.edu/cgi/viewcontent.cgi?article=1131&context=ircs_reports&unstamped=1
dc.source.issue128
dc.source.journalIRCS Technical Reports Series
dc.source.statuspublished
dc.titleOn Descriptive Complexity, Language Complexity, and GB
dc.typeReport
digcom.contributor.authorRogers, James
digcom.identifierircs_reports/128
digcom.identifier.contextkey203023
digcom.identifier.submissionpathircs_reports/128
digcom.typereport
dspace.entity.typePublication
upenn.schoolDepartmentCenterIRCS Technical Reports Series
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
95_14.pdf
Size:
290.95 KB
Format:
Adobe Portable Document Format
Collection