Disambiguating with Controlled Disjunctions
| dc.creator | Blache, Philippe | |
| dc.date | 1997-10-14 | |
| dc.date.accessioned | 2026-07-07T02:36:05Z | |
| dc.date.available | 2026-07-07T02:36:05Z | |
| dc.description | 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 functionnal programming paradigm. | |
| dc.description | requires LaTeX2e, uses tree-dvips, avm | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9710003 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9710003 | |
| dc.identifier | Proceedings of IWPT'97 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/15793 | |
| dc.subject | Computation and Language | |
| dc.title | Disambiguating with Controlled Disjunctions | |
| dc.type | text |