• Korean Journal of Cognitive Science
• /
• v.14 no.1
• /
• pp.29-40
• /
• 2003

Cross-Language Information Retrieval (CLIR) deals with the documents in various languages by one language query. A user who uses one language can retrieve the documents in another language through CLIR system. In CLIR, query translation method is known to be more efficient. For the better performance of query translation, we need more resources like dictionary, ontology, and parallel/comparable corpus but usually not available. This paper proposes a new concept called the Common Base Axis which is adapted to Korean-English Query translation ann a new weighting method in dictionary based query translation. The essential idea is that we can express Korean and English word in one vector space by Common Base Axis and use it in calculating sense distance for query weighting. The experiments show that Common Base Axis gives us good performance without ontology and is especially good for one word query translation.

• The KIPS Transactions:PartB
• /
• v.19B no.3
• /
• pp.183-188
• /
• 2012

One of the major challenge for retrieval performance is the word mismatch between user's queries and documents in information retrieval. To solve the word mismatch problem, we propose a retrieval model based on the degree of association of query concept and word translation probabilities in translation-based model. The word translation probabilities are calculated based on the set of a sentence and its succeeding sentence pair. To validate the proposed method, we experimented on TREC AP test collection. The experimental results show that the proposed model achieved significant improvement over the language model and outperformed translation-based language model.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.7
• /
• pp.680-693
• /
• 2008

Recent studies on XML filtering assume that all data sources follow a single global schema defined in a filtering system. However, beyond this simple assumption, a filtering system can provide a service that allows data publishers to have their own schema; hence, the data sources will become heterogeneous. The number of data sources is expected to be large in a filtering system and the data sources are frequently published, updated, and disappeared, that is, dynamic. In this paper, we introduce implementing a simple and efficient XPath query translation method for such a dynamic environment. The method is especially targeted for a query which is composed based only on users' knowledge and experience without a graphical guidance of the global schema. When a user queries a large number of heterogeneous data, there is a high possibility that the query is not consistent with the same local schema assumed by the user. Our query translation method also supports a function for this problem. Some experimental results for query translation performance have shown that our method has reasonable performance, and is more practical than the existing method.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.953-957
• /
• 2009

This paper proposes a keyword-based query translation system for the semantic web. With the relationship between keywords and ontology structure information, the system converts keyword based queries into queries written by formal query language which is appropriate for the semantic web. As a result, casual web users could not only express queries easily but also obtain the better result.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.101-104
• /
• 2007

Efficient Query processing and optimization are critical for reducing network traffic and decreasing latency of query when accessing and manipulating sensor data of large-scale sensor networks. Currently it has been studied in sensor database projects. These works have mainly focused on in-network query processing for sensor networks and assumes homogeneous sensor networks, where each sensor network has same hardware and software configuration. In this paper, we present a framework for efficient query processing over heterogeneous sensor networks. Our proposed framework introduces query processing paradigm considering two heterogeneous characteristics of sensor networks: (1) data dissemination approach such as push, pull, and hybrid; (2) query processing capability of sensor networks if they may support in-network aggregation, spatial, periodic and conditional operators. Additionally, we propose multi-query optimization strategies supporting cross-translation between data acquisition query and data stream query to minimize total cost of multiple queries. It has been implemented in WSN middleware, COSMOS, developed by ETRI.

• Journal of Information Science Theory and Practice
• /
• v.3 no.1
• /
• pp.24-39
• /
• 2015

Pre-retrieval query formulation is an important step for identifying local text reuse. Local reuse with high obfuscation, paraphrasing, and translation poses a challenge of finding the reused text in a document. In this paper, three pre-retrieval query formulation strategies for heuristic retrieval in case of low obfuscated, high obfuscated, and translated text are studied. The strategies used are (a) Query formulation using proper nouns; (b) Query formulation using unique words (Hapax); and (c) Query formulation using most frequent words. Whereas in case of low and high obfuscation and simulated paraphrasing, keywords with Hapax proved to be slightly more efficient, initial results indicate that the simple strategy of query formulation using proper nouns gives promising results and may prove better in reducing the size of the corpus for post processing, for identifying local text reuse in case of obfuscated and translated text reuse.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.7 no.4
• /
• pp.1-8
• /
• 1997

In this paper, we propose a new intelligent query processing system for relational database !systems. By analyzing previous research results related with fuzzy queries, a new intelligent query processing sysytem is developed and the role of each module including intelligent query processor is defined and :some algorithms for parser, query translation module, inference engine, semantic DB and result com-poser are suggested. By applying a typical example to the proposed intelligent query processing liysytem, reasonable results for the ambiguous query are drawn, and therefore it shows a promising model returning ordered result for both the ambiguous queries and general queries.

• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.3
• /
• pp.183-191
• /
• 2006

As genetic research is getting more active, data construction of genes are needed in the field of biology. Therefore, Gene Ontology Consortium has constructed genetic information by OWL, which is Ontology description language published by W3C. However, previous browsers for Gene Ontology only support simple searching mechanisms based on keyword, tree, and graph, but it is not able to search high quality information considering various relationships. In this paper, we suggest browsing technique which integratesvarious searching methods to support researchers who are doing actually experiment in biology field. Also, instead of typing a query, we propose querv generation technique which constructs query while browsing and query translation technique which translate generated query into SeRQL query It is convenient for user and enables user to obtain high quality information. And by this GO Guide browser, it has been shown that the information of Gene Ontology could be used efficiently.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.3
• /
• pp.35-44
• /
• 2011

Ontologies are playing an important role in semantic web which is emerging as a next stage of the web revolution because various kinds of metadata are described in ontologies. Correspondingly, many query languages like SPARQL, RDQL etc. have been proposed for querying these ontologies. But users have to know the structures and resource names of ontologies completely to get search results even if they have expertise on complex formal logic and syntax of the query languages. Especially, casual users do not know the resource names and may use different words from resource names when they write their query language. This vocabulary gap problem have to be solved to raise the success rate. In this paper, an approach for translating user's search words to corresponding resource names has been proposed. This approach uses semantic similarity between user created search words and ontology resource names.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.5 s.43
• /
• pp.19-27
• /
• 2006

This paper presents a query processing model in a wrapper based on the XML view tree. The query processing in a wrapper requires view composition, query translation into local sources, and generation of XML documents from local query results. We present a query processing model based on the view tree, where the XML views and the XML query is represented by the view tree. Since the view tree keeps the structure of a virtual XML document, it is easy to navigate the path expression. The view tree is also used as a template for schema generation and XML document generation as a query result. Moreover this conceptual uniform abstraction for the XML view and the user query makes it easy to support a multi-level XML view and to implement our composition mechanism.