Asia
Multiscale Analysis of Document Corpora Based on Diffusion Models
Wang, Chang (University of Massachusetts Amherst) | Mahadevan, Sridhar (University of Massachusetts Amherst)
We introduce a nonparametric approach to multiscale analysis of document corpora using a hierarchical matrix analysis framework called diffusion wavelets. In contrast to eigenvector methods, diffusion wavelets construct multiscale basis functions. In this framework, a hierarchy is automatically constructed by an iterative series of dilation and orthogonalization steps beginning with an initial set of orthogonal basis functions, such as the unit-vector bases. Each set of basis functions at a given level is constructed from the bases at the lower level by dilation using the dyadic powers of a diffusion operator. A novel aspect of our work is that the diffusion analysis is conducted on the space of variables (words), instead of instances (documents). This approach can automatically and efficiently determine the number of levels of the topical hierarchy, as well as the topics at each level. Multiscale analysis of document corpora is achieved by using the projections of the documents onto the spaces spanned by basis functions at different levels. Further, when the input term-term matrix is a local diffusion operator, the algorithm runs in time approximately linear in the number of non-zero elements of the matrix. The approach is illustrated on various data sets including NIPS conference papers, 20 Newsgroups and TDT2 data.
Graph-Based Multi-Modality Learning for Topic-Focused Multi-Document Summarization
Wan, Xiaojun (Peking University) | Xiao, Jianguo (Peking University)
Graph-based manifold-ranking methods have been successfully applied to topic-focused multi-document summarization. This paper further proposes to use the multi-modality manifold-ranking algorithm for extracting topic-focused summary from multiple documents by considering the within-document sentence relationships and the cross-document sentence relationships as two separate modalities (graphs). Three different fusion schemes, namely linear form, sequential form and score combination form, are exploited in the algorithm. Experimental results on the DUC benchmark datasets demonstrate the effectiveness of the proposed multi-modality learning algorithms with all the three fusion schemes.
Context-Sensitive Semantic Smoothing Using Semantically Relatable Sequences
Verma, Kamaljeet S. (Indian Institute of Technology Bombay) | Bhattacharyya, Pushpak (Indian Institute of Technology Bombay)
We propose a novel approach to context sensitive semantic smoothing by making use of an intermediate, "semantically light" representation for sentences, called Semantically Relatable Sequences (SRS). SRSs of a sentence are tuples of words appearing in the semantic graph of the sentence as linked nodes depicting dependency relations. In contrast to patterns based on consecutive words, SRSs make use of groupings of non-consecutive but semantically related words. Our experiments on TREC AP89 collection show that the mixture model of SRS translation model and Two Stage Language Model (TSLM) of Lafferty and Zhai achieves MAP scores better than the mixture model of MultiWord Expression (MWE) translation model and TSLM. Furthermore, a system, which for each test query selects either the SRS or the MWE mixture model based on better query MAP score, shows significant improvements over the individual mixture models.
Computational Semantics of Noun Compounds in a Semantic Space Model
Utsumi, Akira (The University of Electro-Communications)
This study examines the ability of a semantic space model to represent the meaning of noun compounds such as "information gathering" or "weather forecast," A new algorithm, comparison, is proposed for computing compound vectors from constituent word vectors, and compared with other algorithms (i.e., predication and centroid) in terms of accuracy of multiple-choice synonym test and similarity judgment test. The result of both tests is that the comparison algorithm is, on the whole, superior to other algorithms, and in particular achieves the best performance when noun compounds have emergent meanings. Furthermore, the comparison algorithm also works for novel noun compounds that do not occur in the corpus. These findings indicate that a semantic space model in general and the comparison algorithm in particular has sufficient ability to compute the meaning of noun compounds.
Context-Based Approach for Pivot Translation Services
Tanaka, Rie (NEC Corporation) | Murakami, Yohei (National Institute of Information and Communications Technology) | Ishida, Toru (Department of Social Informatics, Kyoto University)
Machine translation services available on the Web are becoming increasingly popular. However, a pivot translation service is required to realize translations between non-English languages by cascading different translation services via English. As a result, the meaning of words often drifts due to the inconsistency , asymmetry and intransitivity of word selections among translation services. In this paper, we propose context-based coordination to maintain the consistency of word meanings during pivot translation services. First, we propose a method to automatically generate multilingual equivalent terms based on bilingual dictionaries and use generated terms to propagate context among combined translation services. Second, we show a multiagent architecture as one way of implementation, wherein a coordinator agent gathers and propagates context from/to a translation agent. We generated trilingual equivalent noun terms and implemented a Japanese-to-German-and-back translation, cascading into four translation services. The evaluation results showed that the generated terms can cover over 58% of all nouns. The translation quality was improved by 40% for all sentences, and the quality rating for all sentences increased by an average of 0.47 points on a five-point scale. These results indicate that we can realize consistent pivot translation services through context-based coordination based on existing services.
Introspection and Adaptable Model Integration for Dialogue-based Question Answering
Sonntag, Daniel (German Research Center for AI (DFKI))
Dialogue-based Question Answering (QA) is a highly complex task that brings together a QA system including various natural language processing components (i.e., components for question classification, information extraction, and retrieval) with dialogue systems for effective and natural communication. The dialogue-based access is difficult to establish when the QA system in use is complex and combines many different answer services with different quality and access characteristics. For example, some questions are processed by opendomain QA services with a broad coverage. Others should be processed by using a domain-specific instance ontology for more reliable answers. Different answer services may change their characteristics over time and the dialogue reaction models have to be updated according to that. To solve this problem, we developed introspective methods to integrate adaptable models of the answer services. We evaluated the impact of the learned models on the dialogue performance, i.e., whether the adaptable models can be used for a more convenient dialogue formulation process. We show significant effectiveness improvements in the resulting dialogues when using the machine learning (ML) models. Examples are provided in the context of the generation of system-initiative feedback to user questions and answers, as provided by heterogeneous information services.
Improving a Virtual Human Using a Model of Degrees of Grounding
Roque, Antonio (USC Institute for Creative Technologies) | Traum, David (USC Institute for Creative Technologies)
An exception is which tracks the extent to which material has our Degrees of Grounding model [Roque and Traum, 2008], reached mutual belief in a dialogue, and conduct which provides a more detailed description of the extent to experiments in which the model is used to manage which material has become a part of the common ground during grounding behavior in spoken dialogues with a virtual a dialogue. In this paper we describe experiments in applying human. We show that the model produces improvements that model to handle explicit grounding behavior in in virtual human performance as measured a virtual human. We begin by describing the model and the by post-session questionnaires.
Explicit Versus Latent Concept Models for Cross-Language Information Retrieval
Cimiano, Philipp (Delft University of Technology) | Schultz, Antje (University of Koblenz-Landau) | Sizov, Sergej (University of Koblenz-Landau) | Sorg, Philipp (Technical University of Karlsruhe) | Staab, Steffen (University of Koblenz-Landau)
The field of information retrieval and text manipulation (classification, clustering) still strives for models allowing semantic information to be folded in to improve performance with respect to standard bag-of-word based models. Many approaches aim at a concept-based retrieval, but differ in the nature of the concepts, which range from linguistic concepts as defined in lexical resources such as WordNet, latent topics derived from the data itself—as in Latent Semantic Indexing (LSI) or (Latent Dirichlet Allocation (LDA)—to Wikipedia articles as proxies for concepts, as in the recently proposed Explicit Semantic Analysis (ESA) model. A crucial question which has not been answered so far is whether models based on explicitly given concepts (as in the ESA model for instance) perform inherently better than retrieval models based on "latent" concepts (as in LSI and/or LDA). In this paper we investigate this question closer in the context of a cross-language setting, which inherently requires concept-based retrieval bridging between different languages. In particular, we compare the recently proposed ESA model with two latent models (LSI and LDA) showing that the former is clearly superior to the both. From a general perspective, our results contribute to clarifying the role of explicit vs. implicitly derived or latent concepts in (cross-language) information retrieval research.
Knowledge-Based WSD on Specific Domains: Performing Better than Generic Supervised WSD
Agirre, Eneko (University of the Basque Country (IXA group)) | Lacalle, Oier Lopez de (University of the Basque Country (IXA group)) | Soroa, Aitor (University of the Basque Country)
This paper explores the application of knowledge-based Word Sense Disambiguation systems to specific domains, based on our state-of-the-art graph-based WSD system that uses the information in WordNet. Evaluation was performed over a publicly available domain-specific dataset of 41 words related to Sports and Finance, comprising examples drawn from three corpora: one balanced corpus (BNC), and two domain-specific corpora (news related to Sports and Finance). The results show that in all three corpora our knowledge-based WSD algorithm improves over previous results, and also over two state-of-the-art supervised WSD systems trained on SemCor, the largest publicly available annotated corpus. We also show that using related words as context, instead of the actual occurrence contexts, yields better results on the domain datasets, but not on the general one. Interestingly, the results are higher for domain-specific corpus than for the general corpus, raising prospects for improving current WSD systems when applied to specific domains.
Learning to Follow Navigational Route Instructions
Shimizu, Nobuyuki (University of Tokyo) | Haas, Andrew (State University of New York at Albany)
We have developed a simulation model that accepts instructions in unconstrained natural language, and then guides a robot to the correct destination. The instructions are segmented on the basis of the actions to be taken, and each segment is labeled with the required action. This flat formulation reduces the problem to a sequential labeling task, to which machine learning methods are applied. We propose an innovativemachine learningmethod for explicitly modeling the actions described in instructions and integrating learning and inference about the physical environment. We obtained a corpus of 840 route instructions that experimenters verified as follow-able, given by people in building navigation situations. Using the four-fold cross validation, our experiments showed that the simulated robot reached the correct destination 88% of the time.