Abstract
This paper discusses the problem of disambiguating noun phrases that contain compound words ambiguous with free simple word combinations. Finite-state transducers will be used to both represent the noun phrase ambiguities and to formalize the linguistic constraints that allow the elimination or reduction of the incorrect analyses.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baptista, J.: Estabelecimento e formalização de classes de nomes compostes, MA Thesis, Faculdade de Letras, Universidade de Lisboa, Portugal (1995)
Carvalho, P.: Gramáticas de Resolução de Ambiguidades resultantes da homografía de nomes e adjectivos. MA Thesis, Faculdade de Letras, Universidade de Lisboa (2001)
Gross, M.: Methods and Tactics in the Construction of a Lexicon-Grammar. In: Linguistics in the Morning Calm, selected papers from SICOL-86. Seoul: The Linguistic Society of Korea (1988)
Joshi, A.: A parser from antiquity: An early application of finite state transducers to natural language parsing. In: Kornai, A. (ed.): Extended Finite State Models of Language. Studies in Natural Language Processing. Cambridge University Press (1999)
Laporte, É., Monceaux, A.: Elimination of lexical ambiguities by grammars: The ELAG system. In: Fairon, C. (ed.): Analyse lexicale et syntaxique: Le système INTEX. Lingvisticae Investigationes, XXII (Volume Spécial). Jonh Benjamins, Amsterdam Philadelphia (1998–1999) 341–368
Laporte, È.: Resolução de ambiguidades. In: Ranchhod, E. (ed.): Tratamento das Línguas por Computador. Caminho, Lisboa (2001) 49–89
Ranchhod, E., Mota, C, Baptista, J.: A Computational Lexicon of Portuguese for Automatic Text Parsing. In Proceedings of SIGLEX’ 99: Standardizing Lexical Resources, 37th Annual Meeting of the ACL, Maryland, USA (1999) 74–80
Ranchhod, E.: Ressources linguistiques du portugais implémentées sous INTEX. In: Fairon, C. (ed.): Analyse lexicale et syntaxique: Le système INTEX. Lingvisticae Investigationes, XXII (Volume Spécial). Jonh Benjamins, Amsterdam Philadelphia (1998–1999) 263–278
Ranchhod, E.: O uso de dicionários e de autómates finitos na representação lexical das línguas naturais. In: Ranchhod, E. (ed.): Tratamento das Línguas por Computador. Caminho, Lisboa (2001) 13–47
Roche, E., Schabes, Y.: Introduction, In: Roche, E., Schabes, Y. (eds.): Finite-State Language Processing. Cambridge, Massachussets London: MIT Press (1997) 1–63
Silberztein, M.: Dictionnaires électroniques et analyse automatique de textes: le système INTEX, Masson Ed.: Paris (1993)
Tapanainen, P.: Parsing in two frameworks: finite-state and functional dependency grammar, PhD Thesis, University of Helsinki, Finland (1999)
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
Carvalho, P., Mota, C., Ranchhod, E. (2002). Complex Lexical Units and Automata. In: Ranchhod, E., Mamede, N.J. (eds) Advances in Natural Language Processing. PorTAL 2002. Lecture Notes in Computer Science(), vol 2389. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45433-0_32
Download citation
DOI: https://doi.org/10.1007/3-540-45433-0_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43829-8
Online ISBN: 978-3-540-45433-5
eBook Packages: Springer Book Archive