A logical foundation of preference-based disambiguation:
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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Tokyo, Japan
1991
|
| Series: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
632 |
| Subjects: | |
| Summary: | 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. |
| Physical Description: | 12 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010953927 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960917s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)24940414 | ||
| 035 | |a (DE-599)BVBBV010953927 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Satoh, Ken |d 1959- |e Verfasser |0 (DE-588)134075757 |4 aut | |
| 245 | 1 | 0 | |a A logical foundation of preference-based disambiguation |c K. Satoh |
| 264 | 1 | |a Tokyo, Japan |c 1991 | |
| 300 | |a 12 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 632 | |
| 520 | 3 | |a 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 | |
| 520 | 3 | |a 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. | |
| 650 | 4 | |a Ambiguity | |
| 650 | 4 | |a Natural language processing (Computer science) | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 632 |w (DE-604)BV010923438 |9 632 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007326347 | ||
Record in the Search Index
| _version_ | 1804125440781058048 |
|---|---|
| any_adam_object | |
| author | Satoh, Ken 1959- |
| author_GND | (DE-588)134075757 |
| author_facet | Satoh, Ken 1959- |
| author_role | aut |
| author_sort | Satoh, Ken 1959- |
| author_variant | k s ks |
| building | Verbundindex |
| bvnumber | BV010953927 |
| ctrlnum | (OCoLC)24940414 (DE-599)BVBBV010953927 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02304nam a2200313 cb4500</leader><controlfield tag="001">BV010953927</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960917s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24940414</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010953927</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Satoh, Ken</subfield><subfield code="d">1959-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)134075757</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A logical foundation of preference-based disambiguation</subfield><subfield code="c">K. Satoh</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">12 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">632</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ambiguity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Natural language processing (Computer science)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">632</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">632</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007326347</subfield></datafield></record></collection> |
| id | DE-604.BV010953927 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:36Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007326347 |
| oclc_num | 24940414 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 12 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| series2 | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| spelling | Satoh, Ken 1959- Verfasser (DE-588)134075757 aut A logical foundation of preference-based disambiguation K. Satoh Tokyo, Japan 1991 12 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 632 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. Ambiguity Natural language processing (Computer science) Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 632 (DE-604)BV010923438 632 |
| spellingShingle | Satoh, Ken 1959- A logical foundation of preference-based disambiguation Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Ambiguity Natural language processing (Computer science) |
| title | A logical foundation of preference-based disambiguation |
| title_auth | A logical foundation of preference-based disambiguation |
| title_exact_search | A logical foundation of preference-based disambiguation |
| title_full | A logical foundation of preference-based disambiguation K. Satoh |
| title_fullStr | A logical foundation of preference-based disambiguation K. Satoh |
| title_full_unstemmed | A logical foundation of preference-based disambiguation K. Satoh |
| title_short | A logical foundation of preference-based disambiguation |
| title_sort | a logical foundation of preference based disambiguation |
| topic | Ambiguity Natural language processing (Computer science) |
| topic_facet | Ambiguity Natural language processing (Computer science) |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT satohken alogicalfoundationofpreferencebaseddisambiguation |