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. 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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Incremental Monoidal Grammars
In this work we define formal grammars in terms of free monoidal categories, along with a functor from the category of formal grammars to the category of automata. Generalising from the Booleans to arbitrary semirings, w…
BIG-bench Machine LearningLanguage ModelingLanguage ModellingDictionary Learning with Equiprobable Matching Pursuit
Sparse signal representations based on linear combinations of learned atoms have been used to obtain state-of-the-art results in several practical signal processing applications. Approximation methods are needed to proce…
DenoisingDictionary LearningAnalysing Constraint Grammars with a SAT-solver
We describe a method for analysing Constraint Grammars (CG) that can detect internal conflicts and redundancies in a given grammar, without the need for a corpus. The aim is for grammar writers to be able to automaticall…
Parsing Weighted Order-Preserving Hyperedge Replacement Grammars
Probabilistic Grammars for Equation Discovery
Equation discovery, also known as symbolic regression, is a type of automated modeling that discovers scientific laws, expressed in the form of equations, from observed data and expert knowledge. Deterministic grammars, …
Equation DiscoverySymbolic Regression