Abstract
Structural ambiguity is one of the most difficult problems in natural language processing. Two disambiguation mechanisms for unrestricted text analysis are commonly used: lexical knowledge and context considerations. Our parsing method includes three different mechanisms to reveal syntactic struc- tures and an additional voting module to obtain the most probable structures for a sentence. The developed tools do not require any tagging or syntactic marking of texts.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Collins, M.: Head-driven Statistical Models for Natural language parsing. Ph.D. thesis. University of Pennsylvania. (1999) http://xxx.lanl.gov/ find/cmp-lg/
Yuret, D.: Discovery of Linguistic Relations Using Lexical Attraction. Ph. D. thesis. Massachusetts Institute of Technology. (1998) http://xxx.lanl.gov/ find/cmplg/9805009
Galicia-Haro, S. N, A. Gelbukh, I.A. Bolshakov: Advanced Subcategorization Frames for Languages with Relaxed Word Order Constraints. Natural Language Processing VEXTAL. (1999) 101–110.
Gelbukh, A. F.: Lexical, syntactic, and referential disambiguation using a semantic network dictionary. Technical report. CIC, IPN (1998)
Mel’čuk, I.: Dependency Syntax: Theory and Practice. State University of New York Press (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Galicia-Haro, S.N., Gelbukh, A., Bolshakov, I.A. (2001). Three Mechanisms of Parser Driving for Structure Disambiguation. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2001. Lecture Notes in Computer Science, vol 2004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44686-9_19
Download citation
DOI: https://doi.org/10.1007/3-540-44686-9_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41687-6
Online ISBN: 978-3-540-44686-6
eBook Packages: Springer Book Archive