Sciweavers

Share
ICCI
1993

Pattern Matching for Case Analysis: A Computational Definition of Closeness

10 years 1 months ago
Pattern Matching for Case Analysis: A Computational Definition of Closeness
We propose a conceptually and technically neat method to identify known semantic patterns close to a novel pattern. This occurs in the context of a system to acquire knowledge incrementally from systematically processed expository technical text. This semiautomatic system requires the user to respond to specific multiple-choice questions about the current sentence. The questions are prepared from linguistic elements previously encountered in the text similar to elements in the new sentence. We present a metric to characterize the similarity between semantic Case patterns. The computation is based on syntactic indicators of semantic relations and is defined in terms of symbolic pattern matching.
Sylvain Delisle, Terry Copeck, Stan Szpakowicz, Ke
Added 09 Aug 2010
Updated 09 Aug 2010
Type Conference
Year 1993
Where ICCI
Authors Sylvain Delisle, Terry Copeck, Stan Szpakowicz, Ken Barker
Comments (0)
books