Matroids Hitting Sets and Unsupervised Dependency Grammar Induction
Discrete Mathematics
2017-07-18 v2 Computation and Language
Data Structures and Algorithms
Abstract
This paper formulates a novel problem on graphs: find the minimal subset of edges in a fully connected graph, such that the resulting graph contains all spanning trees for a set of specifed sub-graphs. This formulation is motivated by an un-supervised grammar induction problem from computational linguistics. We present a reduction to some known problems and algorithms from graph theory, provide computational complexity results, and describe an approximation algorithm.
Keywords
Cite
@article{arxiv.1705.08992,
title = {Matroids Hitting Sets and Unsupervised Dependency Grammar Induction},
author = {Nicholas Harvey and Vahab Mirrokni and David Karger and Virginia Savova and Leonid Peshkin},
journal= {arXiv preprint arXiv:1705.08992},
year = {2017}
}
Comments
11 pages 4 figures