arXiv · 1907.05839
Equiprobable mappings in weighted constraint grammars
Abstract
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. Stochastic HG instead does admit equiprobable mappings and we give a complete formal characterization of them. We compare these different predictions of the two frameworks on a test case of Finnish stress.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Arto Anttila, Scott Borgeson, Giorgio Magri. 2019-07-12. Equiprobable mappings in weighted constraint grammars. https://arxiv.org/abs/1907.05839
Cite the original work for its findings. Save a collection to share your selection of sources.