Upper Bounds for Unsupervised Parsing with Unambiguous Non-Terminally Separated Grammars


Unambiguous Non-Terminally Separated (UNTS) grammars have properties that make them attractive for grammatical inference. However, these properties do not state the maximal performance they can achieve when they are evaluated against a gold treebank that is not produced by an UNTS grammar. In this paper we investigate such an upper bound. We develop a… (More)

7 Figures and Tables


  • Presentations referencing similar topics