메뉴 건너뛰기




Volumn 2, Issue , 2011, Pages 676-681

Unary constraints for efficient context-free parsing

Author keywords

[No Author keywords available]

Indexed keywords

COARSE-TO-FINE; CONTEXT-FREE; DISCRIMINATIVE CLASSIFIERS; DOWNSTREAM-PROCESSING; MULTI-WORD; PRUNING METHODS;

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

References (14)
  • 2
    • 0031366914 scopus 로고    scopus 로고
    • Statistical parsing with a context-free grammar and word statistics
    • Menlo Park, CA. AAAI Press/MIT Press
    • Eugene Charniak. 1997. Statistical parsing with a context-free grammar and word statistics. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, pages 598-603, Menlo Park, CA. AAAI Press/MIT Press.
    • (1997) Proceedings of the Fourteenth National Conference on Artificial Intelligence , pp. 598-603
    • Charniak, E.1
  • 6
    • 85127836544 scopus 로고    scopus 로고
    • Discriminative training methods for hidden Markov models: Theory and experiments with perceptron algorithms
    • Philadelphia, July. Association for Computational Linguistics
    • Michael Collins. 2002. Discriminative training methods for hidden Markov models: theory and experiments with perceptron algorithms. In Proceedings of the ACL-02 conference on Empirical Methods in Natural Language Processing, volume 10, pages 1-8, Philadelphia, July. Association for Computational Linguistics.
    • (2002) Proceedings of the ACL-02 Conference on Empirical Methods in Natural Language Processing , vol.10 , pp. 1-8
    • Collins, M.1
  • 7
    • 0043094969 scopus 로고    scopus 로고
    • Parsing with treebank grammars: Empirical bounds, theoretical models, and the structure of the Penn treebank
    • Toulouse, France, July. Association for Computational Linguistics
    • Dan Klein and Christopher D. Manning. 2001. Parsing with treebank grammars: Empirical bounds, theoretical models, and the structure of the Penn treebank. In Proceedings of 39th Annual Meeting of the Association for Computational Linguistics, pages 338-345, Toulouse, France, July. Association for Computational Linguistics.
    • (2001) Proceedings of 39th Annual Meeting of the Association for Computational Linguistics , pp. 338-345
    • Klein, D.1    Manning, C.D.2
  • 10
    • 84857612295 scopus 로고    scopus 로고
    • Learning and inference for hierarchically split PCFGs
    • Slav Petrov and Dan Klein. 2007b. Learning and inference for hierarchically split PCFGs. In AAAI 2007 (Nectar Track).
    • (2007) AAAI 2007 (Nectar Track)
    • Petrov, S.1    Klein, D.2
  • 11
    • 80053415858 scopus 로고    scopus 로고
    • Classifying chart cells for quadratic complexity context-free inference
    • Donia Scott and Hans Uszkoreit, editors, Manchester, UK, August. Association for Computational Linguistics
    • Brian Roark and Kristy Hollingshead. 2008. Classifying chart cells for quadratic complexity context-free inference. In Donia Scott and Hans Uszkoreit, editors, Proceedings of the 22nd International Conference on Computational Linguistics (COLING 2008), pages 745-752, Manchester, UK, August. Association for Computational Linguistics.
    • (2008) Proceedings of the 22nd International Conference on Computational Linguistics (COLING 2008) , pp. 745-752
    • Roark, B.1    Hollingshead, K.2


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