We review both theoretical and practical results of a linguistic approach to studying the structure of features of DNA sequences. Using generative grammars, complex assemblages can not only be described and analyzed abstractly, but also concretely, such that features can be searched for by a general-purpose parser. Our parser, called GenLang, uses an extended logic grammar formalism and has fou...

This paper is concerned with the inexact matching of attributed, relational graphs for structural pattern recognition. The matching procedure is based on a state space search utilizing heuristic information. Some experimental results are reported.

This paper presents a new approach to the use of graph grammars for syntactic pattern recognition. First an introduction concerning the representation of complex two or three-dimensional patterns with labelled nodes and edges is given. Then follows the definition of a special class of graph grammars with rules producing chainand starstructured subgraphs. A constructive inference algorithm is de...

Equal matrix grammars are one of paralel rewriting systems. This type of parallel rewriting systems has been investigated in several areas such as L-systems and the syntactic pattern recognition. In this paper, we introduce two types of structural information and show that if these are available and there is a method of learning regular sets in polynomial time, then for any positive integer $k$...

When a secure component executes sensitive operations, the information carried by the power consumption can be used to recover secret information. Many different techniques have been developped to recover this secret, but only few of them focus on the recovering of the executed code itself. Indeed, the code knowledge acquired through this step of Simple Power Analysis (SPA) can help to identify...

In syntactic pattern recognition a pattern can be represented by a graph. Given an unknown pattern represented by a graph g, the problem of recognition is to determine if the graph g belongs to a language L(G) generated by a graph grammar G. The so-called IE graphs have been defined in [1] for a description of patterns. The IE graphs are generated by so-called ETPL(k) graph grammars defined in ...

This paper describes AliQAn, a monolingual open-domain Question Answering (QA) System developed in the Department of Language Processing and Information Systems at the University of Alicante for CLEF-2005 Spanish monolingual QA evaluation task. Our approach is based fundamentally on the use of syntactic pattern recognition in order to identify possible answers. Beside, Word Sense Disambiguation...

Introduction It is well known that so-called ergative languages are classified roughly into two groups: those which show an ergative pattern only at the morphological level and those which exhibit an ergative pattern also at the syntactic level. Syntactic ergativity is a curious phenomenon in the following respects. First, while there is apparently some correlation between morphological and syn...

In order to discriminate different industrial machine sounds contaminated with perturbations (high noise, speech, etc.), a spectral analysis based on a structural pattern recognition technique is proposed. This approach consists of three steps: 1) to de-noise the machine sounds using the Morlet wavelet transform, 2) to calculate the frequency spectrums for these purified signals, and 3) to conv...