Determining the semantic structure of sentences is a difficult but desired task. In this paper, we propose a system for determining semantic dependency in Chinese sentences. The system is composed of 3 main modules; Syntactic analysis, headword assignment, and semantic dependency assignment. For the semantic dependency module, many classifiers are tested. The best is able to achieve an accuracy...

The dependency injection design pattern improves the configurability, testability, and maintainability of object-oriented applications by decoupling components from both the concrete implementations of their dependencies and the strategy employed to select those implementations. In recent years, a number of libraries have emerged that provide automated support for constructing and connecting de...

This paper explains the principles of dependency analysis by reduction and its correspondence to the notions of dependency and dependency tree. The explanation is illustrated by examples from Czech, a language with a relatively high degree of word-order freedom. The paper sums up the basic features of methods of dependency syntax. The method serves as a basis for the verification (and explanati...

This paper presents a Chinese dependency syntax for treebanking. The syntax contains 13 word classes and 34 dependency types. A format of treebank based on the syntax is also proposed for the applications of computational and general linguistic research. Some experiments show that the treebank based on the proposed dependency syntax can be used for training and evaluating the dependency parser ...

Model transformations are pivotal artifacts in model-driven software projects. As with any software product, maintenance significantly contributes to the lifecycle costs. This is particularly true for model transformations. We present Transformation Analysis, a tool that supplements existing transformation editors under Eclipse with a graph view on the program’s data and control dependencies. T...

Rough set data analysis (RSDA) has recently become a frequently studied symbolic method in data mining. Among other things, it is being used for the extraction of rules from databases; it is, however, not clear from within the methods of rough set analysis, whether the extracted rules are valid. In this paper, we suggest to enhance RSDA by two simple statistical procedures, both based on ran-do...

The goal of this article is to present our work about a combination of several syntactic parsers to produce a more robust parser. We have built a platform which allows us to compare syntactic parsers for a given language by splitting their results in elementary pieces, normalizing them, and comparing them with reference results. The same platform is used to combine several parsers to produce a ...

The task of identifying the “root cause” of a problem becomes increasingly difficult as systems become more complex, yet existing tools for root cause analysis remain fairly primitive. We examine the potential for aiding root cause analysis via auditing of dynamic dependencies at the kernel level. There are two main challenges to this kind of analysis: gathering data without unacceptably degrad...

Component-based software development technique and its intensive use in the industry has led to the wide research in various aspects of component-based systems (CBSs). Dependency analysis is an useful technique that has many applications in software engineering activities including software understanding, testing, debugging, maintenance, and evolution. In this paper, we propose a matrix-based a...

W. Szpankowski* Department of Computer Science Purdue University W. Lafayette. IN 47907 USA Digital tries occur in a variety of computer and communication algorithms including symbolic manipulations, compiling, comparison based searching and sorting, digital retrieval techniques, algorilhms on strings, file systems. codes and communication protocols. It is crucial for all of these applications ...