Sciweavers

2 search results - page 1 / 1
» Charts, Interaction-free Grammars, and the Compact Represent...
Sort
View
IJCAI
1997
13 years 6 months ago
Charts, Interaction-free Grammars, and the Compact Representation of Ambiguity
Recently researchers working in the LFG framework have proposed algorithms for taking advantage of the implicit context-free components of a unification grammar [Maxwell and Kapla...
Marc Dymetman
ACL
2006
13 years 6 months ago
An Improved Redundancy Elimination Algorithm for Underspecified Representations
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 mut...
Alexander Koller, Stefan Thater