conftrace_

2019 ACL ACL 2019

Equiprobable mappings in weighted constraint grammars

Abstract

AbstractWe 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.

🌉 Interdisciplinary Bridge - Computer Science and Natural Language Processing

Authors

Arto Anttila, Scott Borgeson, Giorgio Magri

Topics

Natural Language Processing > Understanding > Syntax Computer Science > Foundations > Formal Languages

Keywords

probabilistic modeling formal language constraint grammar weighted constraint

More from ACL 2019

All ACL 2019 papers →

UDPipe at SIGMORPHON 2019: Contextualized Embeddings, Regularization with Morphological Categories, Corpora Merging

CUNI–Malta system at SIGMORPHON 2019 Shared Task on Morphological Analysis and Lemmatization in context: Operation-based word formation

A Little Linguistics Goes a Long Way: Unsupervised Segmentation with Limited Language Specific Guidance

Unbounded Stress in Subregular Phonology

Data mining Mandarin tone contour shapes

Convolutional neural networks for low-resource morpheme segmentation: baseline or state-of-the-art?