The Computational Similarity of Binding and Long-Distance Consonant Dissimilation
This work shows that the binding patterns are computationally similar to long-distance consonant dissimilation. From a computational point of view, phonological patterns have long been hypothesized to be regular. More recent work has suggested this holds for syntax as well, given the correct representation. By examining binding conditions from morpho-syntactic transformational point of view, we show that binding conditions can be logically characterized in a parallel way to long-distance consonant dissimilation. The similarity shows that binding patterns as transformations fall into a subsequential class, a subregular class of transformations which is considered to capture a great deal of segmental phonological process. This result adds further support to the subregular hypothesis for syntax.