October 2013
Intermediate to advanced
518 pages
16h 20m
English
Graeme Hirst, Department of Computer Science, University of Toronto, Toronto, Canada
Any computer system resolves lexical ambiguities to understand natural language input. This chapter describes the lexical ambiguity resolution component of one such system. It presents a pair of cooperating mechanisms that both disambiguate word senses and determine case slots by finding connections between concepts in a network of frames and by negotiating with one another to find a set of mutually satisfactory meanings. Polaroid Words (PW) are implemented as processes that interpret data structures containing purely lexical information ...
Read now
Unlock full access