Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

ACL
2006

favoriteEmaildiscussreport

116views Computational Linguistics» more ACL 2006»

An Improved Redundancy Elimination Algorithm for Underspecified Representations

13 years 6 months ago

An Improved Redundancy Elimination Algorithm for Underspecified Representations

Download www.coli.uni-saarland.de

We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mutually equivalent readings. The algorithm operates on underspecified chart representations which are derived from dominance graphs; it can be applied to the USRs computed by largescale grammars. We evaluate the algorithm on a corpus, and show that it reduces the degree of ambiguity significantly while taking negligible runtime.

Alexander Koller, Stefan Thater

Real-time Traffic

ACL 2006 | ACL 2007 | Efficient Algorithm | Redundancy Elimination Problem | Underspecified Semantic Representation |

claim paper

Related Content

» Redundancy elimination revisited

» Memory Access Coalescing A technique for Eliminating Redundant memory Accesses

» Eliminating Redundant JoinSet Computations in Static Single Assignment

» Redundancy Elimination for LF

» Redundant feature elimination for multiclass problems

» Generalizing Redundancy Elimination in Checking Sequences

» SmartRE an architecture for coordinated networkwide redundancy elimination

» Dimension reduction with redundant gene elimination for tumor classification

» Computing Optimized Representations for Nonconvex Polyhedra by Detection and Removal of Re...

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2006
Where	ACL
Authors	Alexander Koller, Stefan Thater

Comments (0)