论文部分内容阅读
A synchronous grammar based on the formalism of context-free grammar was developed by gen-eralizing the first component of production that models the source text. Unlike other synchronous grammars, the grammar allows multiple target productions to be associated to a single production rule which can be used to guide a parser to infer different possible translational equivalences for a recognized input string ac-cording to the feature constraints of symbols in the pattern. An extended generalized LR algorithm was adapted to the parsing of the proposed formalism to analyze the syntactic structure of a language. The grammar was used as the basis for building a machine translation system for Portuguese to Chinese trans-lation. The empirical results show that the grammar is more expressive when modeling the translational equivalences of parallel texts for machine translation and grammar rewriting applications.
A synchronous grammar based on the formalism of context-free grammar was developed by gen-eralizing the first component of production that models the source text. Unlike other synchronous grammars, the grammar allows multiple target productions to be associated to a single production rule which can be used to guide a parser to infer different possible translational equivalences for a recognized input string ac-cording to the feature constraints of symbols in the pattern. An extended generalized LR algorithm was adapted to the parsing of the proposed formalism to analyze the syntactic structure of The grammar was used as the basis for building a machine translation system for Portuguese to Chinese trans-lation. The empirical results show that the grammar is more expressive when modeling the translational equivalences of parallel texts for machine translation and grammar rewriting applications.