Hironori Takeuchi, Tetsuya Nasukawa, et al.
Transactions of the Japanese Society for Artificial Intelligence
This paper presents a new method for resolving lexical (word sense) ambiguities inherent in natural language sentences. The Sentence Analyzer (SENA) was developed to resolve such ambiguities by using constraints and example-based preferences. The ambiguities are packed into a single dependency structure, and grammatical and lexical constraints are applied to it in order to reduce the degree of ambiguity. The application of constraints is realized by a very effective constraint-satisfaction technique. Remaining ambiguities are resolved by the use of preferences calculated from an example-base, which is a set of fully parsed word-to-word dependencies acquired semi-automatically from on-line dictionaries.
Hironori Takeuchi, Tetsuya Nasukawa, et al.
Transactions of the Japanese Society for Artificial Intelligence
Karan Bhanot, Ioana Baldini, et al.
AIES 2023
L. Joskowicz, Elisha Sacks
aaai 1994
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence