Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer Science+Business Media New York
About this chapter
Cite this chapter
Tomita, M. (1986). Sentence Disambiguation by Asking. In: Efficient Parsing for Natural Language. The Springer International Series in Engineering and Computer Science, vol 8. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-1885-0_8
Download citation
DOI: https://doi.org/10.1007/978-1-4757-1885-0_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5198-4
Online ISBN: 978-1-4757-1885-0
eBook Packages: Springer Book Archive