메뉴 건너뛰기




Volumn 1996-June, Issue , 1996, Pages 108-115

Directed replacement

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

EID: 85022953593     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (32)

References (15)
  • 4
    • 84968866250 scopus 로고
    • The Use of Finite Automata in the Lexical Representation of Natural Language
    • Springer-Verlag, Berlin, Germany
    • Maurice Gross. 1989. The Use of Finite Automata in the Lexical Representation of Natural Language. In Lecture Notes in Computer Science, pages 34-50, Springer-Verlag, Berlin, Germany.
    • (1989) Lecture Notes in Computer Science , pp. 34-50
    • Gross, Maurice1
  • 5
    • 84878203695 scopus 로고
    • Regular Models of Phonological Rule Systems
    • Ronald M. Kaplan and Martin Kay. 1994. Regular Models of Phonological Rule Systems. Computational Linguistics, 20:3, pages 331-378.
    • (1994) Computational Linguistics , vol.20 , Issue.3 , pp. 331-378
    • Kaplan, Ronald M.1    Kay, Martin2
  • 6
    • 0347110387 scopus 로고
    • A Compiler for Two-level Phonological Rules
    • Report No. CSLL87-108. Center for the Study of Language and Information, Stanford University. Palo Alto, California
    • Lauri Karttunen, Kimmo Koskenniemi, and Ronald M. Kaplan. 1987. A Compiler for Two-level Phonological Rules. In Report No. CSLL87-108. Center for the Study of Language and Information, Stanford University. Palo Alto, California.
    • (1987)
    • Karttunen, Lauri1    Koskenniemi, Kimmo2    Kaplan, Ronald M.3
  • 13


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