<?xml version="1.0" encoding="UTF-8" ?>
<volume id="W16">
  <paper id="4400">
    <title>Proceedings of the Open Knowledge Base and Question Answering Workshop (OKBQA 2016)</title>
    <editor>Key-Sun Choi</editor>
    <editor>Christina Unger</editor>
    <editor>Piek Vossen</editor>
    <editor>Jin-Dong Kim</editor>
    <editor>Noriko Kando</editor>
    <editor>Axel-Cyrille Ngonga Ngomo</editor>
    <month>December</month>
    <year>2016</year>
    <address>Osaka, Japan</address>
    <publisher>The COLING 2016 Organizing Committee</publisher>
    <url>http://aclweb.org/anthology/W16-44</url>
    <bibtype>book</bibtype>
    <bibkey>OKBQA2016:2016</bibkey>
  </paper>

  <paper id="4401">
    <title>Using Wikipedia and Semantic Resources to Find Answer Types and Appropriate Answer Candidate Sets in Question Answering</title>
    <author><first>Po-Chun</first><last>Chen</last></author>
    <author><first>Meng-Jie</first><last>Zhuang</last></author>
    <author><first>Chuan-Jie</first><last>Lin</last></author>
    <booktitle>Proceedings of the Open Knowledge Base and Question Answering Workshop (OKBQA 2016)</booktitle>
    <month>December</month>
    <year>2016</year>
    <address>Osaka, Japan</address>
    <publisher>The COLING 2016 Organizing Committee</publisher>
    <pages>1&#8211;10</pages>
    <url>http://aclweb.org/anthology/W16-4401</url>
    <abstract>This paper proposes a new idea that uses Wikipedia categories as answer types
	and defines candidate sets inside Wikipedia.  The focus of a given question is
	searched in the hierarchy of Wikipedia main pages.  Our searching strategy
	combines head-noun matching and synonym matching provided in semantic
	resources.  The set of answer candidates is determined by the entry hierarchy
	in Wikipedia and the hyponymy hierarchy in WordNet.  The experimental results
	show that the approach can find candidate sets in a smaller size but achieve
	better performance especially for ARTIFACT and ORGANIZATION types, where the
	performance is better than state-of-the-art Chinese factoid QA systems.</abstract>
    <bibtype>inproceedings</bibtype>
    <bibkey>chen-zhuang-lin:2016:OKBQA2016</bibkey>
  </paper>

  <paper id="4402">
    <title>Large-Scale Acquisition of Commonsense Knowledge via a Quiz Game on a Dialogue System</title>
    <author><first>Naoki</first><last>Otani</last></author>
    <author><first>Daisuke</first><last>Kawahara</last></author>
    <author><first>Sadao</first><last>Kurohashi</last></author>
    <author><first>Nobuhiro</first><last>Kaji</last></author>
    <author><first>Manabu</first><last>Sassano</last></author>
    <booktitle>Proceedings of the Open Knowledge Base and Question Answering Workshop (OKBQA 2016)</booktitle>
    <month>December</month>
    <year>2016</year>
    <address>Osaka, Japan</address>
    <publisher>The COLING 2016 Organizing Committee</publisher>
    <pages>11&#8211;20</pages>
    <url>http://aclweb.org/anthology/W16-4402</url>
    <abstract>Commonsense knowledge is essential for fully understanding language in many
	situations. We acquire large-scale commonsense knowledge from humans using a
	game with a purpose (GWAP) developed on a smartphone spoken dialogue system. We
	transform the manual knowledge acquisition process into an enjoyable quiz game
	and have collected over 150,000 unique commonsense facts by gathering the data
	of more than 70,000 players over eight months. In this paper, we present a
	simple method for maintaining the quality of acquired knowledge and an
	empirical analysis of the knowledge acquisition process. To the best of our
	knowledge, this is the first work to collect large-scale knowledge via a GWAP
	on a widely-used spoken dialogue system.</abstract>
    <bibtype>inproceedings</bibtype>
    <bibkey>otani-EtAl:2016:OKBQA2016</bibkey>
  </paper>

  <paper id="4403">
    <title>A Hierarchical Neural Network for Information Extraction of Product Attribute and Condition Sentences</title>
    <author><first>Yukinori</first><last>Homma</last></author>
    <author><first>Kugatsu</first><last>Sadamitsu</last></author>
    <author><first>Kyosuke</first><last>Nishida</last></author>
    <author><first>Ryuichiro</first><last>Higashinaka</last></author>
    <author><first>Hisako</first><last>Asano</last></author>
    <author><first>Yoshihiro</first><last>Matsuo</last></author>
    <booktitle>Proceedings of the Open Knowledge Base and Question Answering Workshop (OKBQA 2016)</booktitle>
    <month>December</month>
    <year>2016</year>
    <address>Osaka, Japan</address>
    <publisher>The COLING 2016 Organizing Committee</publisher>
    <pages>21&#8211;29</pages>
    <url>http://aclweb.org/anthology/W16-4403</url>
    <abstract>This paper describes a hierarchical neural network we propose for sentence
	classification to extract product information from product documents. The
	network classifies each sentence in a document into attribute and condition
	classes on the basis of word sequences and sentence sequences in the document.
	Experimental results showed the method using the proposed network significantly
	outperformed baseline methods by taking semantic representation of word and
	sentence sequential data into account. We also evaluated the network with two
	different product domains (insurance and tourism domains) and found that it was
	effective for both the domains.</abstract>
    <bibtype>inproceedings</bibtype>
    <bibkey>homma-EtAl:2016:OKBQA2016</bibkey>
  </paper>

  <paper id="4404">
    <title>Combining Lexical and Semantic-based Features for Answer Sentence Selection</title>
    <author><first>Jing</first><last>Shi</last></author>
    <author><first>Jiaming</first><last>Xu</last></author>
    <author><first>Yiqun</first><last>Yao</last></author>
    <author><first>Suncong</first><last>Zheng</last></author>
    <author><first>Bo</first><last>Xu</last></author>
    <booktitle>Proceedings of the Open Knowledge Base and Question Answering Workshop (OKBQA 2016)</booktitle>
    <month>December</month>
    <year>2016</year>
    <address>Osaka, Japan</address>
    <publisher>The COLING 2016 Organizing Committee</publisher>
    <pages>30&#8211;38</pages>
    <url>http://aclweb.org/anthology/W16-4404</url>
    <abstract>Question answering is always an attractive and challenging task in natural
	language processing area. There are some open domain question answering
	systems, such as IBM Waston, which take the unstructured text data as input, in
	some ways of humanlike thinking process and a mode of artificial intelligence.
	At the conference on Natural Language Processing and Chinese Computing~(NLPCC)
	2016, China Computer Federation hosted a shared task evaluation about Open
	Domain Question Answering. We achieve the 2nd place at the document-based
	subtask. In this paper, we present our solution, which consists of feature
	engineering in lexical and semantic aspects and model training methods. As the
	result of the evaluation shows, our solution provides a valuable and brief
	model which could be used in modelling question answering or sentence semantic
	relevance. We hope our solution would contribute to this vast and significant
	task with some heuristic thinking.</abstract>
    <bibtype>inproceedings</bibtype>
    <bibkey>shi-EtAl:2016:OKBQA2016</bibkey>
  </paper>

  <paper id="4405">
    <title>An Entity-Based approach to Answering Recurrent and Non-Recurrent Questions with Past Answers</title>
    <author><first>Anietie</first><last>Andy</last></author>
    <author><first>Mugizi</first><last>Rwebangira</last></author>
    <author><first>Satoshi</first><last>Sekine</last></author>
    <booktitle>Proceedings of the Open Knowledge Base and Question Answering Workshop (OKBQA 2016)</booktitle>
    <month>December</month>
    <year>2016</year>
    <address>Osaka, Japan</address>
    <publisher>The COLING 2016 Organizing Committee</publisher>
    <pages>39&#8211;43</pages>
    <url>http://aclweb.org/anthology/W16-4405</url>
    <abstract>An Entity-based approach to Answering recurrent and non-recurrent
	questions with Past Answers
	                              Abstract
	Community question answering (CQA) systems such as Yahoo! Answers allow
	registered-users to ask and answer questions in various question categories.
	However, a significant percentage of asked questions in Yahoo! Answers are
	unanswered. In this paper, we propose to reduce this percentage by reusing
	answers to past resolved questions from the site. Specifically, we propose
	to satisfy unanswered questions in entity rich categories by searching for and
	reusing the best answers to past resolved questions with shared needs. For
	unanswered questions that do not have a past resolved question with a shared
	need, we propose to use the best answer to a past resolved question with
	similar needs. Our experiments on a Yahoo! Answers dataset shows that our
	approach retrieves most of the past resolved questions that have shared and
	similar needs to unanswered questions.</abstract>
    <bibtype>inproceedings</bibtype>
    <bibkey>andy-rwebangira-sekine:2016:OKBQA2016</bibkey>
  </paper>

  <paper id="4406">
    <title>Answer Presentation in Question Answering over Linked Data using Typed Dependency Subtree Patterns</title>
    <author><first>Rivindu</first><last>Perera</last></author>
    <author><first>Parma</first><last>Nand</last></author>
    <booktitle>Proceedings of the Open Knowledge Base and Question Answering Workshop (OKBQA 2016)</booktitle>
    <month>December</month>
    <year>2016</year>
    <address>Osaka, Japan</address>
    <publisher>The COLING 2016 Organizing Committee</publisher>
    <pages>44&#8211;48</pages>
    <url>http://aclweb.org/anthology/W16-4406</url>
    <abstract>In an era where highly accurate Question Answering (QA) systems are being built
	using complex Natural Language Processing (NLP) and Information Retrieval (IR)
	algorithms, presenting the acquired answer to the user akin to a human answer
	is also crucial. In this paper we present an answer presentation strategy by
	embedding the answer in a sentence which is developed by incorporating the
	linguistic structure of the source question extracted through typed dependency
	parsing. The evaluation using human participants proved that the methodology is
	human-competitive and can result in linguistically correct sentences for more
	that 70\% of the test dataset acquired from QALD question dataset.</abstract>
    <bibtype>inproceedings</bibtype>
    <bibkey>perera-nand:2016:OKBQA2016</bibkey>
  </paper>

  <paper id="4407">
    <title>BioMedLAT Corpus: Annotation of the Lexical Answer Type for Biomedical Questions</title>
    <author><first>Mariana</first><last>Neves</last></author>
    <author><first>Milena</first><last>Kraus</last></author>
    <booktitle>Proceedings of the Open Knowledge Base and Question Answering Workshop (OKBQA 2016)</booktitle>
    <month>December</month>
    <year>2016</year>
    <address>Osaka, Japan</address>
    <publisher>The COLING 2016 Organizing Committee</publisher>
    <pages>49&#8211;58</pages>
    <url>http://aclweb.org/anthology/W16-4407</url>
    <abstract>Question answering (QA) systems need to provide exact answers for the questions
	that are posed to the system. However, this can only be achieved through a
	precise processing of the question. During this procedure, one important step
	is the detection of the expected type of answer that the system should provide
	by  extracting the headword of the questions and identifying its semantic type.
	We have annotated the headword and assigned UMLS semantic types to 643
	factoid/list questions from the BioASQ training data. We present statistics on
	the corpus and a preliminary evaluation in baseline experiments. We also
	discuss the challenges on both the manual annotation and the automatic
	detection of the headwords and the semantic types. We believe that this is a
	valuable resource for both training and evaluation of biomedical QA systems.
	The corpus is available at: https://github.com/mariananeves/BioMedLAT.</abstract>
    <bibtype>inproceedings</bibtype>
    <bibkey>neves-kraus:2016:OKBQA2016</bibkey>
  </paper>

  <paper id="4408">
    <title>Double Topic Shifts in Open Domain Conversations: Natural Language Interface for a Wikipedia-based Robot Application</title>
    <author><first>Kristiina</first><last>Jokinen</last></author>
    <author><first>Graham</first><last>Wilcock</last></author>
    <booktitle>Proceedings of the Open Knowledge Base and Question Answering Workshop (OKBQA 2016)</booktitle>
    <month>December</month>
    <year>2016</year>
    <address>Osaka, Japan</address>
    <publisher>The COLING 2016 Organizing Committee</publisher>
    <pages>59&#8211;66</pages>
    <url>http://aclweb.org/anthology/W16-4408</url>
    <abstract>The paper describes topic shifting in dialogues with a robot that provides
	information from Wiki-pedia. The work focuses on a double topical construction
	of dialogue coherence which refers to discourse coherence on two levels: the
	evolution of dialogue topics via the interaction between the user and the robot
	system, and the creation of discourse topics via the content of the Wiki-pedia
	article itself. The user selects topics that are of interest to her, and the
	system builds a list of potential topics, anticipated to be the next topic, by
	the links in the article and by the keywords extracted from the article. The
	described system deals with Wikipedia articles, but could easily be adapted to
	other digital information providing systems.</abstract>
    <bibtype>inproceedings</bibtype>
    <bibkey>jokinen-wilcock:2016:OKBQA2016</bibkey>
  </paper>

  <paper id="4409">
    <title>Filling a Knowledge Graph with a Crowd</title>
    <author><first>GyuHyeon</first><last>Choi</last></author>
    <author><first>Sangha</first><last>Nam</last></author>
    <author><first>Dongho</first><last>Choi</last></author>
    <author><first>KEY-SUN</first><last>CHOI</last></author>
    <booktitle>Proceedings of the Open Knowledge Base and Question Answering Workshop (OKBQA 2016)</booktitle>
    <month>December</month>
    <year>2016</year>
    <address>Osaka, Japan</address>
    <publisher>The COLING 2016 Organizing Committee</publisher>
    <pages>67&#8211;71</pages>
    <url>http://aclweb.org/anthology/W16-4409</url>
    <abstract>},
  url       = {http://aclweb.org/anthology/W16-4409}
}
</abstract>
    <bibtype>inproceedings</bibtype>
    <bibkey>choi-EtAl:2016:OKBQA2016</bibkey>
  </paper>

  <paper id="4410">
    <title>Pairing Wikipedia Articles Across Languages</title>
    <author><first>Marcus</first><last>Klang</last></author>
    <author><first>Pierre</first><last>Nugues</last></author>
    <booktitle>Proceedings of the Open Knowledge Base and Question Answering Workshop (OKBQA 2016)</booktitle>
    <month>December</month>
    <year>2016</year>
    <address>Osaka, Japan</address>
    <publisher>The COLING 2016 Organizing Committee</publisher>
    <pages>72&#8211;76</pages>
    <url>http://aclweb.org/anthology/W16-4410</url>
    <abstract>Wikipedia has become a reference knowledge source for scores of NLP
	applications. One of its invaluable features lies in its multilingual nature,
	where articles on a same entity or concept can have from one to more than 200
	different versions. The interlinking of language versions in Wikipedia has
	undergone a major renewal with the advent of Wikidata, a unified scheme to
	identify entities and their properties using unique numbers.
	However, as the interlinking is still manually carried out by thousands of
	editors across the globe, errors may creep in the assignment of entities. In
	this paper, we describe an optimization technique to match automatically
	language versions of articles, and hence entities, that is only based on bags
	of words and anchors. We created a dataset of all the articles on persons we
	extracted from Wikipedia in six languages:  English, French, German, Russian,
	Spanish, and Swedish. We report a correct match of at least 94.3\% on each
	pair.</abstract>
    <bibtype>inproceedings</bibtype>
    <bibkey>klang-nugues:2016:OKBQA2016</bibkey>
  </paper>

  <paper id="4411">
    <title>SRDF: Extracting Lexical Knowledge Graph for Preserving Sentence Meaning</title>
    <author><first>Sangha</first><last>Nam</last></author>
    <author><first>GyuHyeon</first><last>Choi</last></author>
    <author><first>Younggyun</first><last>Hahm</last></author>
    <author><first>KEY-SUN</first><last>CHOI</last></author>
    <booktitle>Proceedings of the Open Knowledge Base and Question Answering Workshop (OKBQA 2016)</booktitle>
    <month>December</month>
    <year>2016</year>
    <address>Osaka, Japan</address>
    <publisher>The COLING 2016 Organizing Committee</publisher>
    <pages>77&#8211;81</pages>
    <url>http://aclweb.org/anthology/W16-4411</url>
    <abstract>In this paper, we present an open information extraction system so-called SRDF
	that generates lexical knowledge graphs from unstructured texts. In semantic
	web, knowledge is expressed in the RDF triple form but the natural language
	text consist of multiple relations between arguments. For this reason, we
	combine open information extraction with the reification for the full text
	extraction to preserve meaning of sentence in our knowledge graph. And also our
	knowledge graph is designed to adapt for many existing semantic web
	applications. At the end of this paper, we introduce the result of the
	experiment and a Korean template generation module developed using SRDF.</abstract>
    <bibtype>inproceedings</bibtype>
    <bibkey>nam-EtAl:2016:OKBQA2016</bibkey>
  </paper>

  <paper id="4412">
    <title>QAF: Frame Semantics-based Question Interpretation</title>
    <author><first>Younggyun</first><last>Hahm</last></author>
    <author><first>Sangha</first><last>Nam</last></author>
    <author><first>KEY-SUN</first><last>CHOI</last></author>
    <booktitle>Proceedings of the Open Knowledge Base and Question Answering Workshop (OKBQA 2016)</booktitle>
    <month>December</month>
    <year>2016</year>
    <address>Osaka, Japan</address>
    <publisher>The COLING 2016 Organizing Committee</publisher>
    <pages>82&#8211;90</pages>
    <url>http://aclweb.org/anthology/W16-4412</url>
    <abstract>Natural language questions are interpreted to a sequence of patterns to be
	matched with instances of patterns in a knowledge base (KB) for answering. A
	natural language (NL) question answering (QA) system utilizes meaningful
	patterns matching the syntac-tic/lexical features between the NL questions and
	KB. In the most of KBs, there are only binary relations in triple form to
	represent relation between two entities or entity and a value using the domain
	specific ontology. However, the binary relation representation is not enough to
	cover complex information in questions, and the ontology vocabulary sometimes
	does not cover the lexical meaning in questions. Complex meaning needs a
	knowledge representation to link the binary relation-type triples in KB. In
	this paper, we propose a frame semantics-based semantic parsing approach as
	KB-independent question pre-processing. We will propose requirements of
	question interpretation in the KBQA perspective, and a query form
	representation based on our proposed format QAF (Ques-tion Answering with the
	Frame Semantics), which is supposed to cover the requirements. In QAF, frame
	semantics roles as a model to represent complex information in questions and to
	disambiguate the lexical meaning in questions to match with the ontology
	vocabu-lary. Our system takes a question as an input and outputs QAF-query by
	the process which assigns semantic information in the question to its
	corresponding frame semantic structure using the semantic parsing rules.</abstract>
    <bibtype>inproceedings</bibtype>
    <bibkey>hahm-nam-choi:2016:OKBQA2016</bibkey>
  </paper>

  <paper id="4413">
    <title>Answering Yes-No Questions by Penalty Scoring in History Subjects of University Entrance Examinations</title>
    <author><first>Yoshinobu</first><last>Kano</last></author>
    <booktitle>Proceedings of the Open Knowledge Base and Question Answering Workshop (OKBQA 2016)</booktitle>
    <month>December</month>
    <year>2016</year>
    <address>Osaka, Japan</address>
    <publisher>The COLING 2016 Organizing Committee</publisher>
    <pages>91&#8211;96</pages>
    <url>http://aclweb.org/anthology/W16-4413</url>
    <abstract>Answering yes&#8211;no questions is more difficult than simply retrieving ranked
	search results. To answer yes--no questions, especially when the correct
	answer is no, one must find an objectionable keyword that makes the question's
	answer no. Existing systems, such as factoid-based ones, cannot answer yes--no
	questions very well because of insufficient handling of such objectionable
	keywords. We suggest an algorithm that answers yes--no questions by assigning
	an importance to objectionable keywords. Concretely speaking, we suggest a
	penalized scoring method that finds and makes lower score for parts of
	documents that include such objectionable keywords. We check a keyword
	distribution for each part of a document such as a paragraph, calculating the
	keyword density as a basic score. Then we use an objectionable keyword penalty
	when a keyword does not appear in a target part but appears in other parts of
	the document. Our algorithm is robust for open domain problems because it
	requires no training. We achieved 4.45 point better results in F1 scores than
	the best score of the NTCIR-10 RITE2 shared task, also obtained the best score
	in 2014 mock university examination challenge of the Todai Robot project.</abstract>
    <bibtype>inproceedings</bibtype>
    <bibkey>kano:2016:OKBQA2016</bibkey>
  </paper>

  <paper id="4414">
    <title>Dedicated Workflow Management for OKBQA Framework</title>
    <author><first>Jiseong</first><last>Kim</last></author>
    <author><first>GyuHyeon</first><last>Choi</last></author>
    <author><first>KEY-SUN</first><last>CHOI</last></author>
    <booktitle>Proceedings of the Open Knowledge Base and Question Answering Workshop (OKBQA 2016)</booktitle>
    <month>December</month>
    <year>2016</year>
    <address>Osaka, Japan</address>
    <publisher>The COLING 2016 Organizing Committee</publisher>
    <pages>97&#8211;101</pages>
    <url>http://aclweb.org/anthology/W16-4414</url>
    <abstract>Nowadays, a question answering (QA) system is used in various areas such a quiz
	show, personal assistant, home device, and so on. The OKBQA framework supports
	developing a QA system in an intuitive and collaborative ways. To support
	collaborative development, the framework should be equipped with some
	functions, e.g., flexible system configuration, debugging supports, intuitive
	user interface, and so on while considering different developing groups of
	different domains. This paper presents OKBQA controller, a dedicated workflow
	manager for OKBQA framework, to boost collaborative development of a QA system.</abstract>
    <bibtype>inproceedings</bibtype>
    <bibkey>kim-choi-choi:2016:OKBQA2016</bibkey>
  </paper>

</volume>

