Sentence Disambiguation by Asking

  • Masaru Tomita
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 8)


Our parsing algorithm produces all possible parses from an ambiguous sentence. For the algorithm to be useful in practical applications, we need a mechanism to select one intended parse out of a batch of parses. In theory, it is desirable for the system to be able to disambiguate a sentence by semantics and pragmatics, and a large number of techniques using semantic information have been developed to resolve natural language ambiguity [13, 45, 7]. In practice, however, not all ambiguity problems can be solved by those techniques at the current state of the art. Moreover, some sentences are absolutely ambiguous, that is, even a human cannot disambiguate them, unless he knows the intent of the speaker.


Parse Tree Ambiguous Sentence Live Node Input Sentence Phrase Structure Grammar 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1986

Authors and Affiliations

  • Masaru Tomita
    • 1
  1. 1.Carnegie-Mellon UniversityUSA

Personalised recommendations