Victor Pozna'nski, John L. Beaven, and Pete Whitelock. "An Efficient Generation Algorithm for Lexicalist MT". In Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics (ACL), pages 261--267, Cambridge, USA, June 1995. Association for Computational Linguistics.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....uses it with extended LR parsing algorithm. He claims that his algorithm has an advantage in efficiency, since some intermediate data structures in SHDG can be abstracted into a single one. This algorithm, however, cannot be applied to feature structurebased grammar formalism straight forwardly. [PBW95] proposes an improvement of the Shake and Bake generation. The Shake and Bake generation is a sentence generation algorithm for machine translation. The algorithm first parses an input sentence in the source language and collects the lexical and phrasal signs used in that parse. Then it translates ....

....The algorithm first parses an input sentence in the source language and collects the lexical and phrasal signs used in that parse. Then it translates them into the signs in the target language and combines the translated signs filling up by a target language grammar in trial and error. Although [PBW95] improved the trial and error strategy by memoization technique, the computational complexity is still higher than other algorithm. Organization of this article is as follows: Section 2 illustrates the organization of our sentence generation system. Section 3 and 4 explain the overview of the ....

Victor Pozna'nski, John L. Beaven, and Pete Whitelock. "An Efficient Generation Algorithm for Lexicalist MT". In Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics (ACL), pages 261--267, Cambridge, USA, June 1995. Association for Computational Linguistics.

....to extend the use of constraint graphs, while connectivity eliminated certain cases of modifier inefficiency. One line of work on lexicalist generation has used greedy algorithms that start with an initial incorrect and or incomplete parse and iteratively refine it until a complete parse is found (Pozna nski et al. 1995). However, such approaches place restrictions on the grammars which should be avoided if possible. Other work uses memoization in order to prevent the recalculation of previous grammar rule applications (Popowich 1995) this approach yields improvements in execution time, but does not address the ....

Pozna'nski, V., Beaven, J. L., and Whitelock, P. (1995). An efficient generation algorithm for lexicalist MT. In Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics, Boston, MA.

.... Even the Shake and Bake algorithm for MT, which makes use of a more sophisticated lexicon which relates translationally equivalent sets of lexical signs, carrying across the semantic dependencies established by the source language analysis stage into the target language generation stage (Pozna nski et al., 1995) only operates on semantic links between the languages in question. The little theoretically oriented work on multilingual lexicons that does exist is mostly concerned with sense linkage in semantic description (see, e.g. Copestake et al. 1992) 1 . The standard architecture for multilingual ....

V. Pozna'nski, John L. Beaven and P. Whitelock (1995) An efficient Generation Algorithm for lexicalist MT. 33rd Annual Meeting of the Association for Computational Linguistics, 261-267.

....translation correspondence. Generation consists of finding an ordering of the TL bag which satisfies the constraints imposed by the TL grammar. Normally, generation involves a modified parser which ignores ordering information (Brew 1992; Popowich 1995) although other approaches are also possible (Pozna nski et al. 1995). 2.1 Notation We introduce some notation through a simple example of our implementation. Since we will not be concerned with quantification nor scoping, we adopt a simplified transfer representation. If that is, the distinction between systems which construct language independent ....

Pozna'nski, V., Beaven, J. L., and Whitelock, P. (1995). An efficient generation algorithm for lexicalist MT. In Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics, Boston, MA.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC