Journal of Information Processing最新文献

{"title":"Editor's Message to Special Issue on Spoken Document Processing","authors":"S. Nakagawa","doi":"10.2197/IPSJJIP.21.156","DOIUrl":"https://doi.org/10.2197/IPSJJIP.21.156","url":null,"abstract":"Recently, speech recognition technology became popular such as in applications of voice search, speech translation and TV closed caption. Until two decades, researchers and engineers were concerned with how to spread speech recognition technology. When we think of those days, we feel like we are living in a completely different age. Needless to say, it was caused not only by the progress of speech recognition technology, but also endeavor of company, because it is necessary further devise the technology for transferring to a general market. When the technology matched with citizen’s demand, the market will expand rapidly. We can say that the speech recognition technology will get better with age. People say the technical term of “speech recognition” in daily conversation. This is influenced by the commercial of speech recognition applications such as other goods. From a view point of this phenomenon, it looks like the research of spoken language processing is nearly complete, but it is not true. The biggest user demand for speech applications is to improve the speech recognition performance and to make it robust for various environments. Furthermore there still remains a problem how to utilize big data of spoken documents. Significant Interest Group of Spoken Language Information Processing (SIG-SLP) of Information Processing Society of Japan founded “Working Group of Spoken Document Processing” at 1996 and finished in 2012. During that period, the group set the task of spoken retrieval, recorded the spoken documents and published the transcription. At the same time, we held “Workshop of Spoken Document Processing” every year together with Toyohashi University of Technology. In accordance with the progress of speech recognition technology and the increase of spoken documents, the researches related to spoken documents have become more active. Therefore we thought the special issue was valuable for developing such fields and published it firstly in 2009. This is the second special issue. Topics of this issue are related to spoken document/corpus processing of lecture, meeting, broadcasting, spoken dialog, speech translation and so on. We informed the special issue and CFP at the homepage of IPSJ, meeting of SLP and mailing-list. We had 21 submitted papers (29 papers for the first issue) and accepted 11 papers including 3 English papers (13 papers for the first issue). Out of these accepted papers, 5 papers were related to spoken retrieval, because of the influence of the Working Group.","PeriodicalId":16243,"journal":{"name":"Journal of Information Processing","volume":"21 1","pages":"156-156"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.2197/IPSJJIP.21.156","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68499753","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Evaluation Framework Design of Spoken Term Detection Study at the NTCIR-9 IR for Spoken Documents Task","authors":"H. Nishizaki, T. Akiba, K. Aikawa, Tatsuya Kawahara, T. Matsui","doi":"10.5715/JNLP.19.329","DOIUrl":"https://doi.org/10.5715/JNLP.19.329","url":null,"abstract":"This paper describes a design of spoken term detection (STD) studies and their evaluating framework at the STD sub-task of the NTCIR-9 IR for Spoken Documents (SpokenDoc) task. STD is the one of information access technologies for spoken documents. The goal of the STD sub-task is to rapidly detect presence of a given query term, consisting of word or a few word sequences spoken, from the spoken documents included in the Corpus of Spontaneous Japanese. To successfully complete the sub-task, we considered the design of the sub-task and the evaluation methods, and arranged the task schedule. Finally, seven teams participated in the STD subtask and submitted 18 STD results. This paper explains the STD sub-task details we conducted, the data used in the sub-task, how to make transcriptions by speech recognition for data distribution, the evaluation measurement, introduction of the participants’ techniques, and the evaluation results of the task participants.","PeriodicalId":16243,"journal":{"name":"Journal of Information Processing","volume":"19 1","pages":"329-350"},"PeriodicalIF":0.0,"publicationDate":"2012-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71087346","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Evaluating a Virtual Agent Who Responses Attentively to Multiple Players in a Quiz Game","authors":"Hung-Hsuan Huang, T. Nishida","doi":"10.11185/IMT.8.81","DOIUrl":"https://doi.org/10.11185/IMT.8.81","url":null,"abstract":"In developing an entertainment application like a game, evaluating how the players actually interact with the system is an essential issue for its further improvements. This paper proposes and evaluates a quiz game agent who is attentive to the dynamics of multiple concurrent participants (players). The attentiveness of this agent is meant to be achieved by an utterance policy that determines the nature of the utterance and whether, when, and to whom to utter. Two heuristics are introduced to drive the policy: the interaction atmosphere (AT) of the participants and the participant who tends to lead the conversation (CLP) at a specific time point. They are estimated from the activeness of the participants’ face movements and acoustic information during their discussion of the answer. In order to prevent the inherent drawback of a 2D agent that makes it difficult for multiple concurrent users to distinguish the focus of its attention, a physical pointer is also introduced. This system is then evaluated from three aspects, participants’ own subjective measurement by questionnaires, participants’ implicit attitude by an external measuring test, and from third-person view by video data analysis. The joint results of the experiments indicated that the methods for estimating AT and CLP worked. The participants pay more attention to the agent and participate in the game more actively if the indication of the pointer is more comprehensive.","PeriodicalId":16243,"journal":{"name":"Journal of Information Processing","volume":"8 1","pages":"81-96"},"PeriodicalIF":0.0,"publicationDate":"2012-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63627114","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Looking into Socio-cognitive Relations between Urban Areas based on Crowd Movements Monitoring with Twitter","authors":"Shoko Wakamiya, Ryong Lee, K. Sumiya","doi":"10.11185/IMT.7.1571","DOIUrl":"https://doi.org/10.11185/IMT.7.1571","url":null,"abstract":"Due to the proliferation of location-based information services, there is abundant urban information which makes us difficult to catch up with the characteristics and dynamics of our living space. However, nowadays, crowd lifelogs shared over social network sites are attracting a great deal of attention as a novel source to search for local information from the massive voices and lifelogs of crowds. In this regard, we can further look into urban images representing how we recognize a city in mind through the direct massive crowd experiences. In this work, we explore crowd-experienced local information over location-based social network sites to derive much better understandable and useful urban images. In detail, we propose a method to generate a socio-cognitive map where characteristic urban clusters are projected based on cognitive distance between urban areas. Specifically, in order to measure cognitive distances between urban clusters and examine their influential strengths, we observe crowd s movements over Twitter. Finally, we show an experimental result of generating a socio-cognitive map illustrating crowd-sourced cognitive relations between urban clusters in Kinki area, Japan.","PeriodicalId":16243,"journal":{"name":"Journal of Information Processing","volume":"7 1","pages":"1571-1576"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63626837","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Pointwise Approach to Training Dependency Parsers from Partially Annotated Corpora","authors":"Daniel Flannery, Yusuke Miyao, Graham Neubig, Shinsuke Mori","doi":"10.5715/JNLP.19.167","DOIUrl":"https://doi.org/10.5715/JNLP.19.167","url":null,"abstract":"We introduce a word-based dependency parser for Japanese that can be trained from partially annotated corpora, allowing for effective use of available linguistic resources and reduction of the costs of preparing new training data. This is especially important for domain adaptation in a real-world situation. We use a pointwise approach where each edge in the dependency tree for a sentence is estimated independently. Experiments on Japanese dependency parsing show that this approach allows for rapid training and achieves accuracy comparable to state-of-the-art dependency parsers trained on fully annotated data.","PeriodicalId":16243,"journal":{"name":"Journal of Information Processing","volume":"68 1","pages":"167-191"},"PeriodicalIF":0.0,"publicationDate":"2012-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71087252","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Development of a code clone search tool for open source repositories","authors":"Pei Xia, Yuki Manabe, Norihiro Yoshida, Katsuro Inoue","doi":"10.11185/IMT.7.1370","DOIUrl":"https://doi.org/10.11185/IMT.7.1370","url":null,"abstract":"ここに掲載した著作物の利用に関する注意 本著作物の著作権は日本ソフトウェア科学会に帰属します．本著作物は著作権者である日本ソフトウェア科学会の許可のもとに掲載するものです．ご利用に当たっては「著作権法」に従うことをお願いいたします．","PeriodicalId":16243,"journal":{"name":"Journal of Information Processing","volume":"29 1","pages":"1370-1376"},"PeriodicalIF":0.0,"publicationDate":"2012-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63627214","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Proposal of GC Time Reduction Algorithm for Large Java Object Cache","authors":"Yasushi Miyata, M. Obata, Tomoya Ohta, H. Nishiyama","doi":"10.2197/IPSJTRANS.5.145","DOIUrl":"https://doi.org/10.2197/IPSJTRANS.5.145","url":null,"abstract":"Server memory size is continuously growing. To accelerate business data processing of Java-based enterprise systems, the use of large memory is required. One example of such use is the object cache for accelerating read access of a large volume of data. However, Java incorporates a garbage collection (GC) mechanism for reclaiming unused objects. A typical GC algorithm requires finding references from old objects to young objects for identifying unused objects. This means that enlarging the heap memory increases the time for finding references. We propose a GC time reduction algorithm for large object cache systems, which eliminates the need for finding the references from a specific object cache region. This algorithm premises to treat cached objects as immutable objects that only allow READ and REMOVE operations. It also divides the object cache in two regions. The first is a closed region, which contains only immutable objects. The other is an unclosed region, which contains mutable objects that have survived GC. Filling an unclosed region changes the region to closed. When modifying an immutable object, the object is copied to the unclosed region and the modification is applied to the copied object. This restricts references from the object cache region to the region for young objects and excludes changes to the objects in the closed region. Experimental evaluation showed that the proposed algorithm can reduce GC time by 1/4 and improve throughput by 40% compared to traditional generational GC algorithms.","PeriodicalId":16243,"journal":{"name":"Journal of Information Processing","volume":"5 1","pages":"1359-1369"},"PeriodicalIF":0.0,"publicationDate":"2012-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.2197/IPSJTRANS.5.145","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68503845","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Study on Graph Similarity Search","authors":"Haichuan Shang, M. Kitsuregawa","doi":"10.11185/IMT.7.1565","DOIUrl":"https://doi.org/10.11185/IMT.7.1565","url":null,"abstract":"Graph similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical compounds. The problem is challenging as even testing subgraph containment between two graphs is NP-complete. Hence, existing techniques adopt the filtering-and-verification framework with the focus on developing effective and efficient techniques to remove non-promising graphs. Nevertheless, existing filtering techniques may be still unable to effectively remove many ”low” quality candidates. To resolve this, in this paper we propose a novel indexing technique to index graphs according to their ”distances” to features. We then develop lower and upper bounding techniques that exploit the index to (1) prune non-promising graphs and (2) include graphs whose similarities are guaranteed to exceed the given similarity threshold. Considering that the verification phase is not well studied and plays the dominant role in the whole process, we devise efficient algorithms to verify candidates. A comprehensive experiment using real datasets demonstrates that our proposed methods significantly outperform existing methods.","PeriodicalId":16243,"journal":{"name":"Journal of Information Processing","volume":"7 1","pages":"1565-1570"},"PeriodicalIF":0.0,"publicationDate":"2012-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63626795","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Splitting Katakana Noun Compounds by Paraphrasing and Back-transliteration","authors":"Nobuhiro Kaji, M. Kitsuregawa","doi":"10.5715/JNLP.21.897","DOIUrl":"https://doi.org/10.5715/JNLP.21.897","url":null,"abstract":"Word boundaries within noun compounds are not marked by white spaces in a number of languages including Japanese, and it is beneficial for various NLP applications to split such noun compounds. In the case of Japanese, noun compounds made up of katakana words are particularly difficult to split, because katakana words are highly productive and are often out-of-vocabulary. To overcome this difficulty, we propose using paraphrases and back-transliteration of katakana noun compounds for splitting them. Experiments demonstrated that splitting accuracy is improved with a statistical significance by extracting both paraphrases and back-transliterations from unlabeled textual data, and then using that information for constructing splitting models.","PeriodicalId":16243,"journal":{"name":"Journal of Information Processing","volume":"21 1","pages":"897-920"},"PeriodicalIF":0.0,"publicationDate":"2012-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71087129","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Re-ranking Content Based Social Image Search Results by Multi Modal Relevance Feedback","authors":"Jiyi Li, Qiang Ma, Yasuhito Asano, Masatoshi Yoshikawa","doi":"10.11185/IMT.7.1130","DOIUrl":"https://doi.org/10.11185/IMT.7.1130","url":null,"abstract":"Social image hosting websites, such as Flickr, have a rapid growth recently. Content based image retrieval on such websites is an useful potential service but is still unavailable because its performance is unsatisfactory. We propose a multi modal relevance feedback (MMRF) scheme and a supervised re-ranking approach based on it to improve the performance for practical application. Our multi modal scheme utilizes both image and social tag relevance feedback instances. The approach propagates visual and textual information as well as multi modal relevance feedback information on the graph with a mutual reinforcement process. We conduct experiments based on real world data from Flickr to evaluate the performance of our approach. We also conduct an experiment to show that our multi modal relevance feedback scheme significantly improves performance compared with traditional single modal relevance feedback (SMRF) scheme.","PeriodicalId":16243,"journal":{"name":"Journal of Information Processing","volume":"7 1","pages":"1130-1135"},"PeriodicalIF":0.0,"publicationDate":"2012-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63626434","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}