Abstract
In a machine translation system, the number of possible analyses associated with a given sentence is usually very large due to the ambiguous nature of natural languages. But, it is desirable that only the best one or two analyses be translated and passed to the post-editor so as to reduce the required efforts of post-editing. In addition, processing time for a sentence is usually limited when processing a large number of sentences in batch mode. Therefore, it is important, in a practical machine translation system, to obtain the best syntax tree which has the best annotated semantic interpretation within a reasonably short time. This is only possible with an intelligent parsing algorithm which can truncate undesirable analyses as early as possible and avoid wasting time in parsing those ambiguous constructions that will eventually be discarded.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baker, J.K., “Trainable Grammars for Speech Recognition,” Proc. of the Spring Conf. of the Acoustical Society of America, 1979.
Bennett, W.S. and J. Slocum, “The LRC Machine Translation System,” Computational Linguistics, vol. ll.no. 2-3, pp. 111–119, ACL, Apr.-Sep. 1985.
Chiang, T.-H., The Design of a Chinese Phonetic Typewriter, Master thesis, National Tsing Hua University, Hsinchu, TAIWAN, R.O.C., 1989.
Garside, Roger, Geoffrey Leech and Geoffrey Sampson (eds.), The Computational Analysis of English: A Corpus-Based Approach, Longman, New York, 1987.
Marcus, M.P., A Theory of Syntactic Recognition for Natural Language, MIT Press, Cambridge, MA, 1980.
Robinson, J.J., “DIAGRAM: A Grammar for Dialogues,” CACM, vol. 25, no. 1, pp. 27–47, ACM, Jan. 1982.
Su, K.-Y, J.-S. Chang, and H.-H. Hsu, “A Powerful Language Processing System for English-Chinese Machine Translation,” Proc. of 1987 Int. Conf. on Chinese and Oriental Language Computing, pp.260–264, Chicago, III., USA, 1987.
Su, K.-Y, J.-N. Wang, W.-H. Li, and J.-S. Chang, “A New Parsing Strategy in Natural Language Processing Based on the Truncation Algorithm”, Proc. of Natl. Computer Symposium (NCS), pp. 580–586, Taipei, Taiwan. 1987.
Su, K.-Y. and J.-S.Chang, “Semantic and Syntactic Aspects of Score Function,” Proc. COLING-88, vol. 2, pp. 642–644, 12th Int. Conf. on Comput. Linguistics, Budapest, Hungary, 22-27 Aug. 1988.
Su, K.-Y., “Principles and Techniques of Natural Language Parsing: A Tutorial,” Proc. of ROCLING-I, pp.57–61, Nantou, Taiwan. Oct. 1988.
Su, K.-Y. and J.-S. Chang, “Some Key Issues in Designing Machine Translation Systems,” (submitted), 1989.
Su, K.-Y, J.-S. Chang and Y.-C. Lin, “A Unified Approach to Disambiguation Using A Uniform Formulation of Probabilistic Score Functions,” (to appear), 1990.
Tomita, M., “An Efficient Augmented-Context-Free Parsing Algorithm,” Computational Linguistics, vol. 13, no. 1-2, pp. 31–46, 1987.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media New York
About this chapter
Cite this chapter
Su, KY., Wang, JN., Su, MH., Chang, JS. (1991). GLR Parsing with Scoring. In: Tomita, M. (eds) Generalized LR Parsing. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4034-2_7
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4034-2_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6804-5
Online ISBN: 978-1-4615-4034-2
eBook Packages: Springer Book Archive