## REFERENCES

Beesley, Kenneth R. & Karttunen, Lauri (2003). Finite state morphology. Stanford: CSLI.

Chandlee, Jane (2014). Strictly local phonological processes. PhD dissertation, University of Delaware.

Eisner, Jason (1997). Efficient generation in primitive Optimality Theory. In *Proceedings of the 35th Annual Meeting of the ACL and 8th Conference of the European Chapter of the Association for Computational Linguistics*. Morristown, NJ: Association for Computational Linguistics. 313–320.

Gallagher, Gillian, Graff, Peter, Kawahara, Shigeto & Kenstowicz, Michael (eds.) (2012).
*Phonological similarity*. Special issue. Lingua
122. 107–176.

Garey, Michael R. & Johnson, David S. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman.

Gold, E. M. (1967). Language identification in the limit. Information and Control
10. 447–474.

Goldwater, Sharon & Johnson, Mark (2003). Learning OT constraint rankings using a Maximum Entropy model. In Spenader, Jennifer, Eriksson, Anders & Dahl, Östen (eds.) Proceedings of the Stockholm Workshop on Variation within Optimality Theory. Stockholm: Stockholm University. 111–120.

Hayes, Bruce & Wilson, Colin (2008). A maximum entropy model of phonotactics and phonotactic learning. LI
39. 379–440.

Heinz, Jeffrey (to appear). The computational nature of phonological generalizations. In Hyman, Larry M. & Plank, Frans (eds.) Phonological typology. Berlin & New York: Mouton de Gruyter.

Heinz, Jeffrey, Kobele, Gregory M. & Riggle, Jason (2009). Evaluating the complexity of Optimality Theory. LI
40. 277–288.

Hulden, Mans (2009). Foma: a finite-state compiler and library. In *Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: demonstrations session*. Association for Computational Linguistics. 29–32.

Hyman, Larry M. (1975). Phonology: theory and analysis. New York: Holt, Rinehart & Winston.

Idsardi, William J. (2006). A simple proof that Optimality Theory is computationally intractable. LI
37. 271–275.

Jardine, Adam (2016). Locality and non-linear representations in tonal phonology. PhD thesis, University of Delaware.

Kaplan, Ronald & Kay, Martin (1994). Regular models of phonological rule systems. Computational Linguistics
20. 331–378.

Lau, Jey Han, Clark, Alexander & Lappin, Shalom (2016). Grammaticality, acceptability, and probability: a probabilistic view of linguistic knowledge. *Cognitive Science*. doi.org/10.1111/cogs.12414.
Niyogi, Partha (2006). The computational nature of language learning and evolution. Cambridge, Mass.: MIT Press.

Rogers, James (1998). A descriptive approach to language-theoretic complexity. Stanford: CSLI.

Rogers, James & Pullum, Geoffrey K. (2011). Aural pattern recognition experiments and the subregular hierarchy. Journal of Logic, Language and Information
20. 329–342.

Savitch, Walter J. (1993). Why it might pay to assume that languages are infinite. Annals of Mathematics and Artificial Intelligence
8. 17–25.

Stabler, Edward (2014). Towards a rationalist theory of language acquisition. Journal of Machine Learning Research: Workshop and Conference Proceedings
34. 21–32.

Tesar, Bruce & Smolensky, Paul (2000). Learnability in Optimality Theory. Cambridge, Mass.: MIT Press.