Abstract: "In natural language understanding, resolving ambiguity is a very important and difficult problem. A promising method for disambiguation is to use grammatical and semantical preferences and many natural language understanding systems have been built by using this method. In this paper...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Satoh, Ken 1959- (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Tokyo, Japan 1991
Schriftenreihe:	Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 632
Schlagworte:	Ambiguity Natural language processing (Computer science)
Zusammenfassung:	Abstract: "In natural language understanding, resolving ambiguity is a very important and difficult problem. A promising method for disambiguation is to use grammatical and semantical preferences and many natural language understanding systems have been built by using this method. In this paper, we give a logical foundation of such systems. We believe that the logical foundation is useful in understanding of mechanism of disambiguation in a more abstract manner and building more well-behaved systems. The idea of formalizing preference-based disambiguation is as follows. We regard first-order formulas translated from background knowledge and input sentences as axioms Then, preferences can be regarded as an order over logical interpretations of such axioms since preferences express criteria to select plausible readings of input sentences. To express such an order, we can use model-theoretical meta-language [8] which we have already used in formalizing soft constraints in scheduling and design [7]. Since we notice strong concurrence between natural language understanding and scheduling in use of preferences, we would like to show that the technique of formalizing soft constraints in scheduling can be used to give a logical foundation of resolving ambiguity by preferences.
Beschreibung:	12 S.