Towards a redundancy elimination algorithm for underspecified descriptions

Alexander Koller and Stefan Thater

Proceedings of the 5th Intl. Workshop on Inference in Computational Semantics (ICoS-5), Buxton, England, 2006.

This paper proposes an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR), compute an USR which has fewer readings, but still describes at least one representative of each semantic equivalence class of the original readings. The algorithm operates on underspecified chart representations which are derived from dominance graphs; it can be applied to the USRs computed by large-scale grammars. To our knowledge, it is the first redundancy elimination algorithm which maintains underspecification, rather than just enumerating non-redundant readings.

Download: Download (187 K)

BibTex Entry

@InProceedings{KolTha06a, 
   author = {Alexander Koller and Stefan Thater}, 
   title  = {Towards a redundancy elimination algorithm for 
             underspecified descriptions}, 
   year   = 2006, 
   booktitle = {Proceedings of the 5th Intl. Workshop on Inference 
             in Computational Semantics (ICoS-5)}, 
   address = {Buxton, England} 
} 

Back: Publications