Search Results for author:
Found 9 papers, 0 papers with code
Equiprobable mappings in weighted constraint grammars
We show that MaxEnt is so rich that it can distinguish between any two different mappings: there always exists a nonnegative weight vector which assigns them different MaxEnt probabilities.
Efficient Computation of Implicational Universals in Constraint-Based Phonology Through the Hyperplane Separation Theorem
This paper focuses on the most basic \textit{implicational universals} in phonological theory, called \textit{T-orders} after Anttila and Andrus (2006).
Implicational Universals in Stochastic Constraint-Based Phonology
This paper focuses on the most basic implicational universals in phonological theory, called T-orders after Anttila and Andrus (2006).
Cannot find the paper you are looking for? You can
Submit a new open access paper.
