메뉴 건너뛰기




Volumn , Issue , 2009, Pages 69-72

Synchronous rewriting in treebanks

Author keywords

[No Author keywords available]

Indexed keywords

EMPIRICAL INVESTIGATION; MODEL TREES; PROPERTY; TREEBANKS;

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

References (10)
  • 4
    • 0001909598 scopus 로고
    • Finding all the elementary circuits of a directed graph
    • Donald B. Johnson. 1975. Finding all the elementary circuits of a directed graph. SIAM Journal on Computing.
    • (1975) SIAM Journal on Computing
    • Johnson, Donald B.1
  • 8
    • 80053388132 scopus 로고    scopus 로고
    • Computing the most probable parse for a discontinuous phrase-structure grammar
    • Kluwer
    • Oliver Plaehn. 2004. Computing the most probable parse for a discontinuous phrase-structure grammar. In New developments in parsing technology. Kluwer.
    • (2004) New developments in parsing technology
    • Plaehn, Oliver1


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