Abstract
We propose an account of linking patterns that does away with intermediary mechanisms such as thematic or actor/undergoer hierarchies. Instead, constraints on word classes, defined by both syntactic and semantic criteria, encode generalizations between semantic roles and syntactic arguments. We show that the generalizations a linking theory needs to capture can be modeled via the same mechanisms as other lexical generalizations, using conditions specified within the hierarchy of word classes. Each condition provides a partial specification of the mapping between semantic roles and syntactic arguments. We argue that this constraint-based, verb-class-based view of linking offers several empirical advantages: partial regularities and exceptions are easily accommodated, fine-grained semantic distinctions relevant to linking are countenanced, and cross-cutting similarities between semantic and syntactic verb classes are economically captured.
| Original language | English |
|---|---|
| Pages (from-to) | 56-91 |
| Number of pages | 36 |
| Journal | Language |
| Volume | 76 |
| Issue number | 1 |
| DOIs | |
| State | Published - Mar 2000 |
Fingerprint
Dive into the research topics of 'Linking as constraints on word classes in a hierarchical lexicon'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver