@inproceedings{Keselj:2001,
  abstract = { The problem of Question Answering (QA) as used in TREC can be formulated as follows: Given a collection of natural-language (NL) documents find an answer to given NL query that is a short substring of one of the documents, and it is found in a relevant context. We present a novel approach to the problem based on unification-based grammars for NL.},
  added-at = {2007-12-14T02:41:29.000+0100},
  author = {Ke\v{s}elj, Vlado},
  biburl = {http://www.bibsonomy.org/bibtex/23f597c9db03b3bd548555ce321f82f93/diego_ma},
  booktitle = {Proc. AI 2001},
  interhash = {430865fc6aebe9dfd035e48f483c2a48},
  intrahash = {3f597c9db03b3bd548555ce321f82f93},
  keywords = {question_answering HPSG},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science LNAI 2056},
  timestamp = {2007-12-14T02:41:29.000+0100},
  title = {Question Answering Using Unification-based Grammar},
  url = {http://vlado.keselj.net/papers/AI2001.html},
  year = 2001
}