๐
๐
Old Age
Equiprobable mappings in weighted constraint grammars
July 12, 2019 ยท Declared Dead ยท ๐ Proceedings of the 16th Workshop on Computational Research in Phonetics, Phonology, and Morphology
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Arto Anttila, Scott Borgeson, Giorgio Magri
arXiv ID
1907.05839
Category
cs.CL: Computation & Language
Cross-listed
cs.LG
Citations
7
Venue
Proceedings of the 16th Workshop on Computational Research in Phonetics, Phonology, and Morphology
Last Checked
5 months ago
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Computation & Language
๐
๐
Old Age
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
๐
๐
Old Age
XLNet: Generalized Autoregressive Pretraining for Language Understanding
๐ฎ
๐ฎ
The Ethereal
Effective Approaches to Attention-based Neural Machine Translation
๐
๐
Old Age
A large annotated corpus for learning natural language inference
๐
๐
Old Age
HellaSwag: Can a Machine Really Finish Your Sentence?
Died the same way โ ๐ป Ghosted
R.I.P.
๐ป
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
๐ป
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
๐ป
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
๐ป
Ghosted