DeepAI AI Chat
Log In Sign Up

Matroids Hitting Sets and Unsupervised Dependency Grammar Induction

by   Nicholas Harvey, et al.

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.


page 1

page 2

page 3

page 4


Computing Subset Transversals in H-Free Graphs

We study the computational complexity of two well-known graph transversa...

Local-Global Graph Clustering with Applications in Sense and Frame Induction

We present Watset, a new meta-algorithm for fuzzy graph clustering. This...

Production vs Perception: The Role of Individuality in Usage-Based Grammar Induction

This paper asks whether a distinction between production-based and perce...

Neural Bi-Lexicalized PCFG Induction

Neural lexicalized PCFGs (L-PCFGs) have been shown effective in grammar ...

A Neural Model for Regular Grammar Induction

Grammatical inference is a classical problem in computational learning t...

Depth-bounding is effective: Improvements and evaluation of unsupervised PCFG induction

There have been several recent attempts to improve the accuracy of gramm...

Fine-Grained Prediction of Syntactic Typology: Discovering Latent Structure with Supervised Learning

We show how to predict the basic word-order facts of a novel language gi...