메뉴 건너뛰기




Volumn , Issue , 2013, Pages 624-635

Unsupervised spectral learning of WCFG as low-rank matrix completion

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; MATRIX ALGEBRA; NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 84926285760     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (9)

References (26)
  • 2
    • 71149118396 scopus 로고    scopus 로고
    • Grammatical inference as a principal component analysis problem
    • Léon Bottou and Michael Littman, editors Montreal, June. Omnipress
    • Raphaël Bailly, Franois Denis, and Liva Ralaivola. 2009. Grammatical inference as a principal component analysis problem. In Léon Bottou and Michael Littman, editors, Proceedings of the 26th International Conference on Machine Learning, pages 33-40, Montreal, June. Omnipress.
    • (2009) Proceedings of the 26th International Conference on Machine Learning , pp. 33-40
    • Bailly, R.1    Denis, F.2    Ralaivola, L.3
  • 6
    • 80052400030 scopus 로고    scopus 로고
    • A spectral learning algorithm for finite state transducers
    • Borja Balle, Ariadna Quattoni, and Xavier Carreras. 2011. A spectral learning algorithm for finite state transducers. In Proceedings of ECML PKDD, pages 156-171.
    • (2011) Proceedings of ECML PKDD , pp. 156-171
    • Balle, B.1    Quattoni, A.2    Carreras, X.3
  • 7
    • 84867131562 scopus 로고    scopus 로고
    • Local loss optimization in operator models: A new insight into spectral learning
    • John Langford and Joelle Pineau, editors New York, NY, USA, July. Omnipress
    • Borja Balle, Ariadna Quattoni, and Xavier Carreras. 2012. Local loss optimization in operator models: A new insight into spectral learning. In John Langford and Joelle Pineau, editors, Proceedings of the 29th International Conference on Machine Learning (ICML-2012), ICML '12, pages 1879-1886, New York, NY, USA, July. Omnipress.
    • (2012) Proceedings of the 29th International Conference on Machine Learning (ICML-2012), ICML '12 , pp. 1879-1886
    • Balle, B.1    Quattoni, A.2    Carreras, X.3
  • 8
    • 85014561619 scopus 로고    scopus 로고
    • A fast iterative shrinkage-thresholding algorithm for linear inverse problems
    • March
    • Amir Beck and Marc Teboulle. 2009. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Img. Sci., 2(1):183-202, March.
    • (2009) SIAM J. Img. Sci. , vol.2 , Issue.1 , pp. 183-202
    • Beck, A.1    Teboulle, M.2
  • 10
    • 19844383195 scopus 로고    scopus 로고
    • Unsupervised induction of stochastic context-free grammars using distributional clustering
    • Association for Computational Linguistics
    • Alexander Clark. 2001. Unsupervised induction of stochastic context-free grammars using distributional clustering. In Proceedings of the 2001 workshop on Computational Natural Language Learning-Volume 7, page 13. Association for Computational Linguistics.
    • (2001) Proceedings of the 2001 Workshop on Computational Natural Language Learning , vol.7 , pp. 13
    • Clark, A.1
  • 11
    • 33845212445 scopus 로고    scopus 로고
    • Learning deterministic context free grammars: The omphalos competition
    • Alexander Clark. 2007. Learning deterministic context free grammars: The omphalos competition. Machine Learning, 66(1):93-110.
    • (2007) Machine Learning , vol.66 , Issue.1 , pp. 93-110
    • Clark, A.1
  • 17
    • 84877728458 scopus 로고    scopus 로고
    • Identifiability and unmixing of latent parse trees
    • P. Bartlett, F.C.N. Pereira, C.J.C. Burges, L. Bottou, and K.Q. Weinberger, editors
    • Daniel Hsu, Sham Kakade, and Percy Liang. 2012. Identifiability and unmixing of latent parse trees. In P. Bartlett, F.C.N. Pereira, C.J.C. Burges, L. Bottou, and K.Q. Weinberger, editors, Advances in Neural Information Processing Systems 25, pages 1520-1528.
    • (2012) Advances in Neural Information Processing Systems , vol.25 , pp. 1520-1528
    • Hsu, D.1    Kakade, S.2    Liang, P.3
  • 19
  • 20
    • 0002532056 scopus 로고
    • The estimation of stochastic context-free grammars using the inside-outside algorithm
    • Karim Lari and Steve J Young. 1990. The estimation of stochastic context-free grammars using the inside-outside algorithm. Computer speech & language, 4(1):35-56.
    • (1990) Computer Speech & Language , vol.4 , Issue.1 , pp. 35-56
    • Lari, K.1    Young, S.J.2
  • 21
    • 80053356136 scopus 로고    scopus 로고
    • The infinite PCFG using hierarchical dirichlet processes
    • Percy Liang, Slav Petrov, Michael I Jordan, and Dan Klein. 2007. The infinite PCFG using hierarchical dirichlet processes. In EMNLP-CoNLL, pages 688-697.
    • (2007) EMNLP-CoNLL , pp. 688-697
    • Liang, P.1    Petrov, S.2    Jordan, M.I.3    Klein, D.4
  • 23
    • 85059598488 scopus 로고
    • Inside-outside reestimation from partially bracketed corpora
    • Newark, Delaware, USA, June. Association for Computational Linguistics
    • Fernando Pereira and Yves Schabes. 1992. Inside-outside reestimation from partially bracketed corpora. In Proceedings of the 30th Annual Meeting of the Association for Computational Linguistics, pages 128-135, Newark, Delaware, USA, June. Association for Computational Linguistics.
    • (1992) Proceedings of the 30th Annual Meeting of the Association for Computational Linguistics , pp. 128-135
    • Pereira, F.1    Schabes, Y.2
  • 25
    • 56649091092 scopus 로고    scopus 로고
    • Unsupervised learning of probabilistic context-free grammar using iterative biclustering
    • Springer
    • Kewei Tu and Vasant Honavar. 2008. Unsupervised learning of probabilistic context-free grammar using iterative biclustering. In Grammatical Inference: Algorithms and Applications, pages 224-237. Springer.
    • (2008) Grammatical Inference: Algorithms and Applications , pp. 224-237
    • Tu, K.1    Honavar, V.2
  • 26


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.