Disambiguating with Controlled Disjunctions

Philippe Blache


Abstract
In this paper, we propose a disambiguating technique called controlled disjunctions. This extension of the so-called named disjunctions relies on the relations existing between feature values (covariation, control, etc.). We show that controlled disjunctions can implement different kind of ambiguities in a consistent and homogeneous way. We describe the integration of controlled disjunctions into a HPSG feature structure representation. Finally, we present a direct implementation by means of delayed evaluation and we develop an example within the functional programming paradigm.
Anthology ID:
1997.iwpt-1.5
Volume:
Proceedings of the Fifth International Workshop on Parsing Technologies
Month:
September 17-20
Year:
1997
Address:
Boston/Cambridge, Massachusetts, USA
Venues:
IWPT | WS
SIG:
SIGPARSE
Publisher:
Association for Computational Linguistics
Note:
Pages:
1–7
Language:
URL:
https://aclanthology.org/1997.iwpt-1.5
DOI:
Bibkey:
Cite (ACL):
Philippe Blache. 1997. Disambiguating with Controlled Disjunctions. In Proceedings of the Fifth International Workshop on Parsing Technologies, pages 1–7, Boston/Cambridge, Massachusetts, USA. Association for Computational Linguistics.
Cite (Informal):
Disambiguating with Controlled Disjunctions (Blache, IWPT 1997)
Copy Citation:
PDF:
https://preview.aclanthology.org/update-css-js/1997.iwpt-1.5.pdf