Skip to main content
SpringerLink
Log in

Three Mechanisms of Parser Driving for Structure Disambiguation

  • Conference paper
  • First Online:
Computational Linguistics and Intelligent Text Processing (CICLing 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2004))

  • 767 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Collins, M.: Head-driven Statistical Models for Natural language parsing. Ph.D. thesis. University of Pennsylvania. (1999) http://xxx.lanl.gov/ find/cmp-lg/

  2. Yuret, D.: Discovery of Linguistic Relations Using Lexical Attraction. Ph. D. thesis. Massachusetts Institute of Technology. (1998) http://xxx.lanl.gov/ find/cmplg/9805009

  3. 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.

    Google Scholar 

  4. Gelbukh, A. F.: Lexical, syntactic, and referential disambiguation using a semantic network dictionary. Technical report. CIC, IPN (1998)

    Google Scholar 

  5. Mel’čuk, I.: Dependency Syntax: Theory and Practice. State University of New York Press (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Natural Language Processing Laboratory. Center for Computer Research, National Polytechnic Institute, Juan de Dios Batiz s/n 07738, México, Mexico

    Sofía N. Galicia-Haro, Alexander Gelbukh & Igor A. Bolshakov

Authors
  1. Sofía N. Galicia-Haro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexander Gelbukh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Igor A. Bolshakov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CIC (Centro de Investigación en Computatción IPN (Instituto Politécnico Nacional), Av. Juan Dios Bátiz s/n esq. M. Othon Mendizabal Col. Nuevo Vallejo, CP. 07738, México, Mexico

    Alexander Gelbukh (Unidad Profecional “Adolfo López Mateos”) (Unidad Profecional “Adolfo López Mateos”)

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation