Abstract
Lexical (and structural) ambiguities make language as expressive as it is.Computational lexicons thus have to cope with a large amount of polysemous words. Research in the last decade (e. g., Pustejovsky (1995), Kilgarriff and Gazdar (1995)) has aimed at identifying different types of polysemy in order to capture underlying regularities. This paper deals with a subtype of regular polysemy illustrated by the following sentences:
Cite
CITATION STYLE
Hartrumpf, S., & Schulz, M. (1997). Reducing lexical redundancy by augmenting conceptual knowledge. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1303, pp. 393–396). Springer Verlag. https://doi.org/10.1007/3540634932_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
