메뉴 건너뛰기




Volumn 3, Issue , 2005, Pages 1412-1417

WebCrow: A WEB-based system for CROssWord solving

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPETITION; GAME THEORY; KNOWLEDGE BASED SYSTEMS; LINGUISTICS; PROBLEM SOLVING;

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

References (13)
  • 1
    • 0010442827 scopus 로고    scopus 로고
    • On the algorithmic implementation of multiclass kernel-based vector machines
    • Crammer, K., and Singer, Y. 2002. On the algorithmic implementation of multiclass kernel-based vector machines. J. Mach. Learn. Res. 2:265-292.
    • (2002) J. Mach. Learn. Res. , vol.2 , pp. 265-292
    • Crammer, K.1    Singer, Y.2
  • 5
    • 0040673186 scopus 로고    scopus 로고
    • Scaling question answering to the web
    • Kwok, C.; Etzioni, O.; and Weld, D. S. 2001. Scaling question answering to the web. ACM Trans. Inf. Syst. 19(3):242-262.
    • (2001) ACM Trans. Inf. Syst. , vol.19 , Issue.3 , pp. 242-262
    • Kwok, C.1    Etzioni, O.2    Weld, D.S.3
  • 6
    • 29344435538 scopus 로고    scopus 로고
    • Review: Computer language games
    • Littman, M. L. 2000. Review: computer language games. Computer and Games 134:396-404.
    • (2000) Computer and Games , vol.134 , pp. 396-404
    • Littman, M.L.1
  • 7
    • 0016930483 scopus 로고
    • Computer construction of crossword puzzles using precedence relationships
    • Mazlack, L. J. 1976. Computer construction of crossword puzzles using precedence relationships. Artificial Intelligence 7:1-19.
    • (1976) Artificial Intelligence , vol.7 , pp. 1-19
    • Mazlack, L.J.1
  • 8
    • 29344452707 scopus 로고    scopus 로고
    • Program crosses web to fill in puzzling words
    • News-Nature
    • News-Nature. 2004. Program crosses web to fill in puzzling words. Nature 431:620.
    • (2004) Nature , vol.431 , pp. 620
  • 9
    • 0000463496 scopus 로고
    • Heuristic search viewed as path finding in a graph
    • Pohl, I. 1970. Heuristic search viewed as path finding in a graph. Artificial Intelligence 1:193-204.
    • (1970) Artificial Intelligence , vol.1 , pp. 193-204
    • Pohl, I.1
  • 10
    • 0042096783 scopus 로고
    • Improvements in part-of-speech tagging with an application to german
    • Schmid, H. 1995. Improvements in part-of-speech tagging with an application to german. In Proceedings of the EACL SIGDAT Workshop.
    • (1995) Proceedings of the EACL SIGDAT Workshop
    • Schmid, H.1
  • 11
    • 0032596626 scopus 로고    scopus 로고
    • Solving crosswords as probabilistic contraint satisfaction
    • Shazeer, N. M.; Keim, G. A.; and Littman, M. L. 1999. Solving crosswords as probabilistic contraint satisfaction. In Proceeding of AAAI '99, 156-152.
    • (1999) Proceeding of AAAI '99 , pp. 156-1152
    • Shazeer, N.M.1    Keim, G.A.2    Littman, M.L.3
  • 12
    • 14344250451 scopus 로고    scopus 로고
    • Support vector machine learning for interdependent and structured output spaces
    • ACM Press
    • Tsochantaridis, I.; Hofmann, T.; Joachims, T.; and Altun, Y. 2004. Support vector machine learning for interdependent and structured output spaces. In Proceedings of ICML '04. ACM Press.
    • (2004) Proceedings of ICML '04
    • Tsochantaridis, I.1    Hofmann, T.2    Joachims, T.3    Altun, Y.4
  • 13
    • 0041024111 scopus 로고    scopus 로고
    • Overview of the TREC-9 question answering track
    • Department of Commerce, National Institute of Standards and Technology
    • Voorhees, E. M., and Tice, D. M. 2000. Overview of the TREC-9 question answering track. In Proceedings of TREC-9. Department of Commerce, National Institute of Standards and Technology.
    • (2000) Proceedings of TREC-9
    • Voorhees, E.M.1    Tice, D.M.2


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