Abstract
Reference-set constraints are a special class of constraints used in Minimalist syntax. They extend the notion of well-formedness beyond the level of single trees: When presented with some phrase structure tree, they compute its set of competing output candidates and determine the optimal output(s) according to some economy metric. Doubts have frequently been raised in the literature whether such constraints are computationally tractable [4]. I define a subclass of Optimality Systems (OSs) that is sufficiently powerful to accommodate a wide range of reference-set constraints and show that these OSs are globally optimal [5], a prerequisite for them being computable by linear tree transducers. As regular and linear context-free tree languages are closed under linear tree transductions, this marks an important step towards showing that the expressivity of various syntactic formalisms is not increased by adding reference-set constraints. In the second half of the paper, I demonstrate the feasibility of the OS-approach by exhibiting an efficiently computable OS for a prominent reference-set constraint, Focus Economy [10].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chomsky, N.: The Minimalist Program. MIT Press, Cambridge (1995)
Frank, R., Satta, G.: Optimality theory and the generative complexity of constraint violability. Computational Linguistics 24, 307–315 (1998)
Gécseg, F., Steinby, M.: Tree Automata. Academei Kaido, Budapest (1984)
Johnson, D., Lappin, S.: Local Constraints vs. Economy. CSLI, Stanford (1999)
Jäger, G.: Gradient constraints in finite state OT: The unidirectional and the bidirectional case. In: Kaufmann, I., Stiebels, B. (eds.) More than Words. A Festschrift for Dieter Wunderlich, pp. 299–325. Akademie Verlag, Berlin (2002)
Karttunen, L.: The proper treatment of optimality in computational phonology (1998); manuscript, Xerox Research Center Europe
Kepser, S., Mönnich, U.: Closure properties of linear context-free tree languages with an application to optimality theory. Theoretical Computer Science 354, 82–97 (2006)
Kobele, G.M.: Without Remnant Movement, mGs are Context-Free. In: Ebert, C., Jäger, G., Michaelis, J. (eds.) MOL 10. LNCS, vol. 6149, pp. 160–173. Springer, Heidelberg (2010)
Kobele, G.M., Retoré, C., Salvati, S.: An automata-theoretic approach to minimalism. In: Rogers, J., Kepser, S. (eds.) Model Theoretic Syntax at 10, pp. 71–80 (2007); Workshop Organized as Part of the Europen Summer School on Logic, Language and Information (ESSLLI 2007), Dublin, Ireland, August 6-17 (2007)
Reinhart, T.: Interface Strategies: Optimal and Costly Computations. MIT Press, Cambridge (2006)
Rogers, J.: A Descriptive Approach to Language-Theoretic Complexity. CSLI, Stanford (1998)
Stabler, E.P., Keenan, E.: Structural similarity. Theoretical Computer Science 293, 345–363 (2003)
Wartena, C.: A note on the complexity of optimality systems. In: Blutner, R., Jäger, G. (eds.) Studies in Optimality Theory, pp. 64–72. University of Potsdam, Potsdam (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Graf, T. (2012). Reference-Set Constraints as Linear Tree Transductions via Controlled Optimality Systems. In: de Groote, P., Nederhof, MJ. (eds) Formal Grammar. FG FG 2010 2011. Lecture Notes in Computer Science, vol 7395. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32024-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-32024-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32023-1
Online ISBN: 978-3-642-32024-8
eBook Packages: Computer ScienceComputer Science (R0)