메뉴 건너뛰기




Volumn , Issue , 2003, Pages

Semantic coherence scoring using an ontology

Author keywords

[No Author keywords available]

Indexed keywords

NATURAL LANGUAGE PROCESSING SYSTEMS; ONTOLOGY; SEMANTICS;

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

References (17)
  • 5
    • 84937275232 scopus 로고    scopus 로고
    • Assessing agreement on classification tasks: The kappa statistic
    • Jean Carletta. 1996. Assessing agreement on classification tasks: The kappa statistic. Computational Linguistics, 22(2):249–254.
    • (1996) Computational Linguistics , vol.22 , Issue.2 , pp. 249-254
    • Carletta, Jean1
  • 7
    • 0042660763 scopus 로고    scopus 로고
    • Speech and language processing for next-millenium communications services
    • R.V. Cox, C.A. Kamm, L.R. Rabiner, J. Schroeter, and J.G. Wilpon. 2000. Speech and language processing for next-millenium communications services. Proceedings of the IEEE, 88(8):1314–1334.
    • (2000) Proceedings of the IEEE , vol.88 , Issue.8 , pp. 1314-1334
    • Cox, R.V.1    Kamm, C.A.2    Rabiner, L.R.3    Schroeter, J.4    Wilpon, J.G.5
  • 9
    • 85009220763 scopus 로고    scopus 로고
    • SPIN: Language understanding for spoken dialogue systems using a production system approach
    • Ralf Engel. 2002. SPIN: Language understanding for spoken dialogue systems using a production system approach. In Proceedings of ICSLP 2002.
    • (2002) Proceedings of ICSLP 2002
    • Engel, Ralf1
  • 12
    • 0027189233 scopus 로고
    • Word graphs: An efficient interface between continuous-speech recognition and language understanding
    • Martin Oerder and Hermann Ney. 1993. Word graphs: An efficient interface between continuous-speech recognition and language understanding. In ICASSP Volume 2, pages 119–122.
    • (1993) ICASSP , vol.2 , pp. 119-122
    • Oerder, Martin1    Ney, Hermann2
  • 14
    • 0025627406 scopus 로고
    • The n-best algorithm: an efficient and exact procedure for finding the n most likely sentence hypotheses
    • Albuquerque, USA
    • R. Schwartz and Y. Chow. 1990. The n-best algorithm: an efficient and exact procedure for finding the n most likely sentence hypotheses. In Proceedings of ICASSP’90, Albuquerque, USA.
    • (1990) Proceedings of ICASSP’90
    • Schwartz, R.1    Chow, Y.2


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