PublisherAssociation for Computational Linguistics
Rights accessOpen Access
We derive a spectral method for unsupervised
learning ofWeighted Context Free Grammars.
We frame WCFG induction as finding a Hankel
matrix that has low rank and is linearly
constrained to represent a function computed
by inside-outside recursions. The proposed algorithm picks the grammar that agrees with a sample and is the simplest with respect to the nuclear norm of the Hankel matrix.
CitationBailly, R. [et al.]. Unsupervised spectral learning of WCFG as low-rank matrix completion. A: Conference on Empirical Methods in Natural Language Processing. "Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing". Seattle: Association for Computational Linguistics, 2013, p. 624-635.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org