|
Expressivity and Complexity in Underspecified Semantic Representation| old_uid | 4070 |
|---|
| title | Expressivity and Complexity in Underspecified Semantic Representation |
|---|
| start_date | 2008/02/13 |
|---|
| schedule | 14h |
|---|
| online | no |
|---|
| location_info | salle des theses |
|---|
| summary | Most systems for underspecified scope representation are not
expressively complete in that they do not permit the enumeration of all possible subsets of scope interpretations. Ebert (2005) shows that a framework for underspecified scope representation is expressively
complete iff does not provide a tractable procedure for enumerating the set of possible scope interpretations. It is possible to reduce complexity in generating scope readings by using dynamic filters that are added incrementally in a dialogue. However, such filters will only achieve limited reductions in search space for certain non-worst case
scenarios. The general complexity problem for underspecified scope representations, encoded as partial orders, turns out to be even more seriousness than Ebert's result. I consider three possible ways of dealing with this complexity problem when generating scope interpretations from underspecified representations in the course of a dialogue |
|---|
| responsibles | Mothe, Lemarié, Debats |
|---|
| |
|