Efficient Construction of Underspecified Semantics under Massive Ambiguity

Details Efficient Construction of Underspecified Semantics under Massive Ambiguity Efficient Construction of Underspecified Semantics under Massive Ambiguity

1997-06-26

arxiv.org/abs/cmp-lg/9706028v1

Proceedings of ACL/EACL'97

Computer Science

Computation and Language

9 pages, 7 postscript figures, LaTeX source (aclap, psfig styles)

Scientific paper

We investigate the problem of determining a compact underspecified semantical representation for sentences that may be highly ambiguous. Due to combinatorial explosion, the naive method of building semantics for the different syntactic readings independently is prohibitive. We present a method that takes as input a syntactic parse forest with associated constraint-based semantic construction rules and directly builds a packed semantic structure. The algorithm is fully implemented and runs in $O(n^4 log(n))$ in sentence length, if the grammar meets some reasonable `normality' restrictions.

Affiliated with

Also associated with

No associations

Rating

Efficient Construction of Underspecified Semantics under Massive Ambiguity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient Construction of Underspecified Semantics under Massive Ambiguity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Construction of Underspecified Semantics under Massive Ambiguity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-227463