No label defined (Q3780475)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4043288
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4043288 |
Statements
1987
0 references
decidability
0 references
segment translation system
0 references
ordered set of rules
0 references
translation algorithm
0 references
equivalence problem
0 references
0 references
0.8139817
0 references
0 references
0.7993293
0 references
[For the entire collection see Zbl 0624.00016.] In connection with the design and implementation of an algorithm that generates a formal translation system by analyzing a set of only a few examples of the underlying translation process the new model of a segment translation system has been developed, which is very suitable for formalizing translation processes of comparatively low complexity (e.g. braille, phonology, hyphenation). Each segment translation system consists of an ordered set of rules \(u\to v[x,y]\) with the meaning: the segment u of a word w should be translated into the segment v if u has x as left context and y as right context in w. After a precise definition of the model of a segment translation system and its application as a translation algorithm the paper shows, that the power of this model is strictly below that of a finite transducer. Furthermore it turns out that the equivalence problem for the subclass of character translation systems is decidable, this question being still open for the classes of segment translation systems and deterministic finite transducers, respectively.
0 references