Please use this identifier to cite or link to this item:
doi:10.22028/D291-25780 | Title: | Underspecified beta reduction |
| Author(s): | Bodirsky, Manuel Erk, Katrin Koller, Alexander Niehren, Joachim |
| Language: | English |
| Year of Publication: | 2001 |
| OPUS Source: | Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics, Toulouse, France, July 6-11, 2001. - San Francisco: Morgan Kaufmann Publishers, 2001, pp.74-81. |
| SWD key words: | Constraint-logische Programmierung |
| Free key words: | Beta Reduction |
| DDC notations: | 004 Computer science, internet |
| Publikation type: | Conference Paper |
| Abstract: | For ambiguous sentences, traditional semantics construction produces large numbers of higher-order formulas,which must then be beta-reduced individually. Underspecified versions can produce compact descriptions of all readings, but it is not known how to perform beta reduction on these descriptions. We show how to do this using beta reduction constraints in the constraint language for lambda-structures (CLLS). |
| Link to this record: | urn:nbn:de:bsz:291-scidok-3011 hdl:20.500.11880/25836 http://dx.doi.org/10.22028/D291-25780 |
| Date of registration: | 12-Jul-2004 |
| Faculty: | MI - Fakultät für Mathematik und Informatik |
| Department: | MI - Informatik |
| Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
| File | Description | Size | Format | |
|---|---|---|---|---|
| usp-beta.pdf | 112,33 kB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.