메뉴 건너뛰기




Volumn , Issue , 1996, Pages 127-132

Figures of Merit for Best-First Probabilistic Chart Parsing

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

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

References (11)
  • 2
    • 0042214357 scopus 로고
    • Learning probabilistic dependency grammars from labeled text
    • a pages AAAI
    • Glenn Carroll and Eugene Charniak. 1992a. Learning probabilistic dependency grammars from labeled text. In Working Notes, Fall Symposium Series, pages 25-32. AAAI.
    • (1992) Working Notes, Fall Symposium Series , pp. 25-32
    • Carroll, Glenn1    Charniak, Eugene2
  • 7
    • 84930565154 scopus 로고
    • Computation of the probability of initial substring generation by stochastic context-free grammars
    • Frederick Jelinek and John D. Lafferty. 1991. Computation of the probability of initial substring generation by stochastic context-free grammars. Computational Linguistics, 17:315-323.
    • (1991) Computational Linguistics , vol.17 , pp. 315-323
    • Jelinek, Frederick1    Lafferty, John D.2
  • 8
    • 84989385300 scopus 로고
    • Calculating the probability of a partial parse of a sentence
    • Fred Kochman and Joseph Kupin. 1991. Calculating the probability of a partial parse of a sentence. In DARPA Speech and Language Workshop, pages 237-240.
    • (1991) DARPA Speech and Language Workshop , pp. 237-240
    • Kochman, Fred1    Kupin, Joseph2


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