Abstract. Structural pattern recognition plays a central role in many applications. Recent advances include new theoretical results, methods and successful applications. In the present talk, some recent graph-based methods for shape analysis will be shown. The presented methods include a new representation for graph-matchingbased interactive segmentation and models for the analysis of spatial r...

The problem of automation of syntactic analysis of the Lithuanian simple sentences is investigated. The features of Lithuanian language – great inflexion and free word order in a sentence – which raise the specific claims for solving the problem of syntactic analysis of Lithuanian sentences are highlighted. The formalized procedure of syntactic analysis is based on the Backus and Naur formalism...

We present an integrated probabilistic model for Japanese syntactic and case structure analysis. Syntactic and case structure are simultaneously analyzed based on wide-coverage case frames that are constructed from a huge raw corpus in an unsupervised manner. This model selects the syntactic and case structure that has the highest generative probability. We evaluate both syntactic structure and...

1. Linguistic Basis for Computations . . . . . . .153 .1 Immediate Constituent Analysis ....... 154 .2 String Analysis ......... 154 .3 Lcft-to-Kight Scanning and Predictive Analysis .... 155 .4 Transformationul Analysis ........ 156 .5 Other Methods 156 2. A Procedure for Left-to-RightString Decomposition of Sentences . 157 2.1 Word-by-\Vord Formulation of String Structure .... 157 2.2 Indirec...

Due to recent development in the area of computational formalisms for linguistic representation, the task of designing a parser for a speciied natural language is now shifted to the problem of designing its grammar in certain formal ways. This paper describes the results of a project whose aim was to design a formal grammar for modern Hebrew. Such a formal grammar has never been developed befor...

This paper describes a practical parser for unrestricted relations. These relations are computed between chunks and speci ed within a unique formalism. They are represented by means of labeled and directed links. The present implementation handles dependency, coordination and antecedence relations.