750461
A Phonetic-Based Approach to Chinese Chat Text Normalization
Chatting is a popular communication media on the Internet via ICQ, chat rooms, etc. Chat language is different from natural language due to its anomalous and dynamic natures, which renders conventional NLP tools inapplicable. The dynamic problem is enormously troublesome because it makes static chat language corpus outdated quickly in representing contemporary chat language. To address the dynamic problem, we propose the phonetic mapping models to present mappings between chat terms and standard words via phonetic transcription, i.e. Chinese Pinyin in our case. Different from character mappings, the phonetic mappings can be constructed from available standard Chinese corpus. To perform the task of dynamic chat language term normalization, we extend the source channel model by incorporating the phonetic mapping models. Experimental results show that this method is effective and stable in normalizing dynamic chat language terms.
37472111
Extending the superimposed codeword indexing scheme to handle incomplete information
In order to use Prolog as a basis for database applications, techniques are required for rapid retrieval of clauses from large data sets. Various researchers have contributed to the development of indexing strategies for this purpose. One such strategy is known as superimposed codeword+mask bits (SCW+MB). One extension of Prolog which is useful in the development of deductive databases is the ability to handle incomplete information. A form of incomplete information based on sets has been introduced and used in a deductive database system. In order to provide efficient access to clauses containing incomplete information, existing strategies need to be adapted accordingly. This paper presents an extension to the SCW+MB algorithm to cover incomplete information, and describes how this can be realized in hardware.
16840924
Improving Transliteration with Precise Alignment of Phoneme Chunks and Using Contextual Features
Automatic transliteration of foreign names is basically regarded as a diminutive clone of the machine translation (MT) problem. It thus follows IBM's conventional MT models under the source-channel framework. Nonetheless, some parameters of this model dealing with zero-fertility words in the target sequences, can negatively impact transliteration effectiveness because of the inevitable inverted conditional probability estimation. Instead of source-channel, this paper presents a direct probabilistic transliteration model using contextual features of phonemes with a tailored alignment scheme for phoneme chunks. Experiments demonstrate superior performance over the source-channel for the task of English-Chinese transliteration.
7493579
CLARE—a Prolog database machine
The CLAuse Retrieval Engine (CLARE) is a coprocessor system which based on two-stage filtering, for handling large sets of disc resident clauses in Prolog database applications. The overall architecture and the timing measurements of the first stage CLARE hardware are reported. The timing measurements shows that the first stage CLARE hardware can perform search operations on data transferring at a rate up to 4.5 million double bytes per second.
12876616
A Design of Temporal Event Extraction from Chinese Financial News
This paper presents an information system for Chinese Information Extraction from Financial news (CHIEF). The ultimate target of the system is to extract information concerning the occurrence time and places of the financial activities in the different companies from a local Hong Kong newspaper, namely (Tao Kung Pao). To facilitate event extraction purpose, two groups of templates were defined, i.e. the company related and company restructuring templates. They are used to select the desired information for each type of financial activities, such as (bankruptcy) or (merge). Each specific event is then represented using a frame-based knowledge structure. Two types of slots are embedded in each frame: they are the activity- and time-related slots. Based on these slots, multiple activities are interconnected according to their entity relations, temporal relations or the deduced relations. Effectively, CHIEF is a question-answering system designed for handling the company related queries, event based queries, temporal queries and complex queries in a finance domain.
690242
Improving Quality of Email Categorization with Tournament Methods
The tournament text classification methods are proposed in this article to perform the task of email categorization, in which the essence is to break down the multi-class categorization process into a set of binary classification tasks. We implement the methods of elimination and Round Robin tournament to classify emails within 15 folders. Substantial experiments are conducted to compare the effectiveness and robustness of the tournament methods against the n-way classification method and the voting method. The experimental results show that the tournament methods outperform the n-way method by 11.7% and the voting method by 4.1% regarding precision, and the Round Robin performs slightly better than the Elimination tournament on average.
19534046
Animating the Evolution Process of Genetic Algorithms
This paper reports the work on the development of an animation system for visualising the optimisation process of the Genetic Algorithm. The description on the requirements and structure of the system is presented. The developed system is applied to visualise some six testing cases. Sequences of animation shots of the evolution process for solving the Branin RCOS problem and the Schaffer-6 problem are presented. In the latter example, the effect of a solution acceleration technique is also demonstrated. The method of building the visualisation system can be applied to other evolutionary computation techniques.
62724310
3D model reconstruction by constrained bundle adjustment
The accuracy of the reconstruction of 3D objects using vision-based techniques depends ultimately on an optimization technique known as bundle adjustment. However, direct application of bundle adjustment fails to make full use of the constraints inherent in the objects' motion. Most of the scanner systems available today use a turntable to rotate an object so as to capture images of the object from different view points. For these systems, the motion of the object is constrained to rotate around a fixed axis. By incorporating this constraint into the traditional bundle adjustment method, we show that a more accurate reconstructed model can be obtained. This "constrained" bundle adjustment method must be useful in the design of low-cost, yet accurate, 3D scanners for use in manufacturing and entertainment industry.
11555065
Reverse Engineering Scripting Language Extensions
Software systems are often written in more than one programming language. During development, programmers need to understand not only the dependencies among code in a particular language, but dependencies that span languages. In this paper, we focus on the problem of scripting languages (such as Perl) and their extension mechanisms to calling functions with a C interface. Our general approach involves building a fact extractor for each scripting language, by hooking into the language interpreter itself. The produced facts conform to a common schema, and an analyzer is extended to recognize the cross-language dependencies. We present how these statically discovered dependencies can be represented, visualized, and explored in the Eclipse environment
31921180
Fast elliptic scalar multiplication using new double-base chain and point halving
The fast implementation of elliptic curve cryptosystems relies on the efficient computation of scalar multiplication. Based on the double-base chain representation of scalar using powers of 2 and 3, we propose a new representation with powers of 1/2 and 3 instead. Thus the efficient point halving operation can be incorporated in the new double-base chain to achieve fast scalar multiplication. Experimental results show that our approach leads to a lower complexity which contributes to the efficient implementation of elliptic curve cryptosystems.
18706172
Connecting technical communicators with technical developers
Most program documentation is written by developers for developers. This often results in documentation that is less than satisfactory in terms of quality, relevance, and longevity of information to developers who will be responsible for subsequent enhancements to the product. This paper outlines an approach to producing effective program documentation by connecting technical communicators and technical developers in a pair-wise manner. This approach is modeled on the development methodology advocated by eXtreme Programming (XP). Programmers who adopt XP work in pairs, and thus are in constant communication with one another. By pairing a technical communicator with a technical developer, many of the same benefits can be gained. Rather than eschewing program documentation, the paired communicator and developer instead produce high-quality documentation during the development process, with little extra effort, resulting in a more maintainable software application. The paper also describes some recent experiences in pairing a senior person and a junior person in communicator and developer roles to enhance program documentation of a long-lived and popular research application.