Current trends in computer linguistics and problem of the machine translation of Arabic

The aim of this paper is to present some problems concerning the machine translation of Arabic in the context of the chosen NLP theories and their evolution. First attempts of electronic machine translations in Europe started only a little more than fifty years ago. It is enough time to perceive some aspects of the evolution? Although a lot of the concepts are still valid, the situation in A.D. 2012 is quite different than even twelve years ago. We still see useful old works of N. Chomsky, D. Cohen, but CFG seems to be supported with some new theories which also have got some disadvantages. Some interesting problems occur in the process of automatic translation when the number of grammatical cases is smaller in the source language than that in the output language.The aim of this paper is to present some problems concerning the machine translation of Arabic in the context of the chosen NLP theories and their evolution. First attempts of electronic machine translations in Europe started only a little more than fifty years ago. It is enough time to perceive some aspects of the evolution? Although a lot of the concepts are still valid, the situation in A.D. 2012 is quite different than even twelve years ago. We still see useful old works of N. Chomsky, D. Cohen, but CFG seems to be supported with some new theories which also have got some disadvantages. Some interesting problems occur in the process of automatic translation when the number of grammatical cases is smaller in the source language than that in the output language

Synchronous forest substitution grammars

The expressive power of synchronous forest (tree-sequence) substitution grammars (SFSGs) is studied in relation to multi bottom-up tree transducers (MBOTs). It is proved that SFSGs have exactly the same expressive power as compositions of an inverse MBOT with an MBOT. This result is used to derive complexity results for SFSGs and the fact that compositions of an MBOT with an inverse MBOT can compute tree translations that cannot be computed by any SFSG, although the class of tree translations computable by MBOTs is closed under composition

Tree Transducers and Formal Methods (Dagstuhl Seminar 13192)

The aim of this Dagstuhl Seminar was to bring together researchers from various research areas related to the theory and application of tree transducers. Recently, interest in tree transducers has been revived due to surprising new applications in areas such as XML databases, security verification, programming language theory, and linguistics. This seminar therefore aimed to inspire the exchange of theoretical results and information regarding the practical requirements related to tree transducers