메뉴 건너뛰기




Volumn , Issue , 1998, Pages 79-82

Finding Structure via Compression

Author keywords

[No Author keywords available]

Indexed keywords

% REDUCTIONS; DATA SEQUENCES; GRAMMATICAL INFERENCES; INFERENCE SYSTEMS; INSTANTANEOUS ENTROPIES; LANGUAGE MODEL; STATISTICAL LANGUAGE MODELLING; THRESHOLDING;

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

References (6)
  • 3
    • 84930565154 scopus 로고
    • Computation of the probability of initial substring generation by stochastic context free grammars
    • Jelinek, Frederick and John D. Lafferty. 1991. Computation of the probability of initial substring generation by stochastic context free grammars. Computational Linguistics, 17(3):315-323.
    • (1991) Computational Linguistics , vol.17 , Issue.3 , pp. 315-323
    • Jelinek, Frederick1    Lafferty, John D.2
  • 4
    • 0025516650 scopus 로고
    • Implementingthe PPM data compression scheme
    • November
    • Moffat, Alistair. 1990. Implementingthe PPM data compression scheme. IEEE Transactions on Communications, 38(11):1917-1921, November.
    • (1990) IEEE Transactions on Communications , vol.38 , Issue.11 , pp. 1917-1921
    • Moffat, Alistair1
  • 6
    • 85004809837 scopus 로고
    • The discovery of segments in natural language
    • Wolff, J. G. 1977. The discovery of segments in natural language. British Journal of Psychology, 68:97-106.
    • (1977) British Journal of Psychology , vol.68 , pp. 97-106
    • Wolff, J. G.1


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