Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
An efficient augmented-context-free parsing algorithm
Computational Linguistics
On multiple context-free grammars
Theoretical Computer Science
Journal of the ACM (JACM)
An efficient context-free parsing algorithm
Communications of the ACM
Introduction to the special issue on word sense disambiguation: the state of the art
Computational Linguistics - Special issue on word sense disambiguation
Synchronous models of language
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Synchronous tree-adjoining grammars
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Multitext Grammars and synchronous parsers
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
Generalized multitext grammars
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
A flexible example annotation schema: translation corresponding tree representation
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Syntax directed translations and the pushdown assembler
Journal of Computer and System Sciences
Systematic processing of long sentences in rule based portuguese-chinese machine translation
CICLing'10 Proceedings of the 11th international conference on Computational Linguistics and Intelligent Text Processing
Hi-index | 0.02 |
This paper proposes a variation of synchronous grammar based on the formalism of context-free grammar by generalizing the first component of productions that models the source text, named Constraint-based Synchronous Grammar (CSG). Unlike other synchronous grammars, CSG allows multiple target productions to be associated to a single source production rule, which can be used to guide a parser to infer different possible translational equivalences for a recognized input string according to the feature constraints of symbols in the pattern. Furthermore, CSG is augmented with independent rewriting that allows expressing discontinuous constituents in the inference rules. It turns out that such grammar is more expressive to model the translational equivalences of parallel texts for machine translation, and in this paper, we propose the use of CSG as a basis for building a machine translation (MT) system for Portuguese to Chinese translation.