Abstract
This paper describes the rule-based approach for ambiguity resolution used by English sentence parser in E-TRAN 2001, an English to Korean machine translation system. Parser’s Ambiguity Type Information (PATI) is used to automatically identify the types of ambiguities observed in competing candidate trees produced by the parser and summarizes the types into a formal representation. PATI provides an efficient way of encoding knowledge into grammar rules and calculating rule preference scores from a relatively small training corpus. We compare the enhanced grammar with the initial one in view of the amount of ambiguity. The experimental results show that the rule preference scores could significantly increase the accuracy of ambiguity resolution.
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, K.L., Franz, A.M., Jordan, P.W.: Coping with Ambiguity in a Large-Scale Machine Translation System. Proceedings of COLING-94 (1994)
Oepen, S., Carroll, J.: Ambiguity Packing in Constraint-based Parsing-Practical Results. Proceedings of the 1st Conference of the North American Chapter of the Association for Computational Linguistics (NAACL’00), Seattle, WA (2000)
Lavie, A., Rose, C.: Optimal ambiguity packing in context-free parsers with interleaved unification. Proceedings of the 6th International Workshop on Parsing Technologies, Trento, Italy (2000) 147–158
Fass, D., Wilks, Y.: Preference Semantics, Ill-Formedness, and Metaphor. American Journal of Computational Linguistics, vol.9(3–4) (1983) 178–187
Wang, J.: Syntactic Preferences for Robust Parsing with Semantic Preferences. Proceedings of COLING-92, Nantes (1992) 239–245
Kimball, J.: Seven Principles of Surface Structure Parsing in Natural Language. Cognition, vol. 2 (1973) 15–47
Dyer, M.G.: Symbolic NeuroEngineering and natural language processing: a multilevel research approach. Advances in Connectionist and Neural Computation Theory, Vol. 1, Ablex Publishing Corp., Norwood, N.J. (1991) 32–68
Waltz, D.L., Pollack, J.B.: Massive Parallel Parsing: A Strongly Interactive Model of Natural Language Interpretation. Cognitive Science, Vol. 9 (1985) 51–74
Alshawi, H., Carter, D.: Training and Scaling Preference Functions for Disambiguation. Computational Linguistics, 20(4) (1994) 635–648
Gazdar, G., Klein, E., Pullum, G., Sag, I.: Generalized Phrase Structure Grammar, Blackwell (1985)
Shim, K.S.: Structural Disambiguation of to-infinitives using Augmented Collocations. Ph.D. thesis, Department of Computer Engineering, Seoul National University (1994)
Chun, S.J.: A Study on Prepositional Phrase Attachment and the Transfer of the Preposition using Semantic Hierarchy. Master thesis, Department of Computer Engineering, Seoul National University (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, J.W., Kim, SD. (2002). PATI: An Approach for Identifying and Resolving Ambiguities. In: Ishizuka, M., Sattar, A. (eds) PRICAI 2002: Trends in Artificial Intelligence. PRICAI 2002. Lecture Notes in Computer Science(), vol 2417. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45683-X_49
Download citation
DOI: https://doi.org/10.1007/3-540-45683-X_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44038-3
Online ISBN: 978-3-540-45683-4
eBook Packages: Springer Book Archive