Titlebook: ;

脫毛

Inference of Finite-State Transducers by Using Regular Grammars and Morphisms,rs and regular grammars. The technique consists of: 1) building a corpus of training strings from the corpus of training pairs; 2) inferring a regular grammar and 3) transforming the grammar into a finite-state transducer..The proposed method was assessed through a series of experiments within the f

和諧

Computational Complexity of Problems on Probabilistic Grammars and Transducers,e more used than determinism grammars. Computing the probability of parsing a given string or its most probable parse with . can be performed in linear time. However, the problem of finding the most probable string has yet not given any satisfactory answer. In this paper we prove that the problem is

為寵愛

gustation

嚴(yán)峻考驗(yàn)

cutlery

Inferring Subclasses of Contextual Languages,s of internal contextual languages, namely, k-uniform and strictly internal contextual languages which are incomparable classes and provide an algorithm to learn these classes. The algorithm can be used when the rules are applied in a parallel mode.

壓碎

舊病復(fù)發(fā)

Computation of Substring Probabilities in Stochastic Grammars,ern recognition problems concerning the prediction and/or recognition based on partial observations. This paper presents algorithms for the computation of substring probabilities in stochastic regular languages. Situations covered include prefix, suffix and island probabilities. The computational ti

小步走路

A Comparative Study of Two Algorithms for Automata Identification,Trakhenbrot and Barzdin/Gold by one hand and the ./Lang algorithm by the other. As a previous step, for a better comparison, we formulate the algorithm of Gold as a merging states in the prefix tree acceptor scheme.

巡回