نتایج جستجو برای: dependency analysis

تعداد نتایج: 2853672  

2010
Elaine Uí Dhonnchadha Josef van Genabith

In this paper we present a partial dependency parser for Irish, in which Constraint Grammar (CG) rules are used to annotate dependency relations and grammatical functions in unrestricted Irish text. Chunking is performed using a regular-expression grammar which operates on the dependency tagged sentences. As this is the first implementation of a parser for unrestricted Irish text (to our knowle...

2004
Hisami Suzuki

Extraction of predicate-argument structure is an important task that requires evaluation for many applications, yet annotated resources of predicate-argument structure are currently scarce, especially for languages other than English. This paper presents an evaluation of a Japanese parser based on dependency relations as proposed by Lin (1995, 1998), but using phrase dependency instead of word ...

2013
Matthias Keil Peter Thiemann

Dependency analysis is a program analysis that determinespotential data flow between program points. While it is not asecurity analysis per se, it is a viable basis for investigatingdata integrity, for ensuring confidentiality, and for guaran-teeing sanitization. A noninterference property can be statedand proved for the dependency analysis.We have designed and implement...

Journal: :Advances in Science, Technology and Engineering Systems Journal 2020

Journal: :IJCIP 2016
George Stergiopoulos Panayiotis Kotzanikolaou Marianthi Theoharidou Georgia Lykou Dimitris Gritzalis

Dependency analysis of critical infrastructures is a computationally intensive problem when dealing with large-scale, cross-sectoral, cascading and common-cause failures. The problem intensifies when attempting a dynamic, time-based dependency analysis. This paper extends a previous graph-based risk analysis methodology to dynamically assess the evolution of cascading failures over time. Variou...

2004
Jürgen Giesl René Thiemann Peter Schneider-Kamp

The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible methods to prove termination. In this paper, we show that dependency pairs can instead be used as a general concept to integrate arbitrary techniques for termination analysis. In this way, the benefits of different te...

2014
Meishan Zhang Yue Zhang Wanxiang Che Ting Liu

Recent work on Chinese analysis has led to large-scale annotations of the internal structures of words, enabling characterlevel analysis of Chinese syntactic structures. In this paper, we investigate the problem of character-level Chinese dependency parsing, building dependency trees over characters. Character-level information can benefit downstream applications by offering flexible granularit...

2008
Alvin S. Lim

Large and complex software usually change incremen-tally over the period they are in active use. Programming environments must allow software designers to make these changes easily and eeciently. The key to supporting adaptable software is providing eecient abstraction and composition mechanisms. By separating speciication of well-deened components from the component interaction and composition...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید