| Abstract |
The resolution of prepositional phrase (PP) attachment has always been a nightmare for computational linguists. This type of attachment is part of a more general problem linked to the resolution of syntactic ambiguities. Several methods have been suggested, ranging from the use of statistical data to select the statistically most frequent constructions, to the use of machine-readable dictionaries from which the semantic information necessary to resolve ambiguities is extracted [Jensen & Binot 1987, Richardson et al. 1993, 1998, Richardson 1997, Vanderwende 1995]. The latter work has led to the construction oflarge knowledge bases in the form ofnetworks ofwords linked by lexical-semantic relationsextracted from dictionary definitions. In this paper, we show how grammatical codes reflecting the syntactic environment in which a lexical item can be inserted can be used by a broad-coverage parser in order to give preference to syntactic codes initiating the densest or most complex structures. |
| BibTex |
@InProceedings{ELX02-007,
author = {Thierry Fontenelle, Alma Kharrat},
title = {Using Dictionary Grammar Codes to Resolve Attachment Ambiguities},
pages = {97-104},
booktitle = {Proceedings of the 10th EURALEX International Congress},
year = {2002},
month = {aug},
date = {13-17},
address = {København, Denmark},
editor = {Anna Braasch and Claus Povlsen},
publisher = {Center for Sprogteknologi},
isbn = {87-90708-09-1},
} |
