Curbing Feature Coding: Strictly Local Feature Assignment
- Thomas Graf (Stony Brook University)
Abstract
Graf (2017) warns that every syntactic formalism faces a severe overgeneration problem because of the hidden power of subcategorization. Any constraint definable in monadic second-order logic can be compiled into the category system so that it is indirectly enforced as part of subcategorization. Not only does this kind of feature coding deprive syntactic proposals of their empirical bite, it also undermines computational efforts to limit syntactic formalisms via subregular complexity. This paper presents a subregular solution to feature coding. Instead of features being a cheap resource that comes for free, features must be assigned by a transduction. In particular, category features must be assigned by an input strictly local (ISL) tree-to-tree transduction, defined here for the first time. The restriction to ISL transductions correctly rules out various deviant category systems.
Keywords: computational syntax, features, selection, tree transductions, input strictly local
How to Cite:
Graf, T., (2020) “Curbing Feature Coding: Strictly Local Feature Assignment”, Society for Computation in Linguistics 3(1), 362-371. doi: https://doi.org/10.7275/f7y5-xz32
Downloads:
Download PDF