Parsing as constraint transformation: an extension of cu-Prolog
Abstract: "Natural language processing involves a very complex flow of information which cannot be stipulated in terms of procedural programs. This necessitates some sort of constraint programming. In order to embody this picture, we have developed a constraint logic programming (CLP) language...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1990
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum
984 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Natural language processing involves a very complex flow of information which cannot be stipulated in terms of procedural programs. This necessitates some sort of constraint programming. In order to embody this picture, we have developed a constraint logic programming (CLP) language cu-Prolog. Unlike most CLP systems, cu-Prolog allows user- defined and dynamically defined predicates to represent symbolic/combinatorial constraints. The constraint satisfaction in cu- Prolog is regarded as a sort of unfold/fold transformation of logic programming. This paper extends cu-Prolog and presents a constraint-based approach to sentence comprehension First, local constraints on the feature structure of categories of the unification-based grammar such as HPSG and JPSG are treated as constraints of cu-Prolog. In this respect, mainly feature constraint is processed not as procedures but as constraints. Second, the constraint transformation method is extended here, by incorporating global variables and a tabulation technique, so that parsing of a context-free language is subsumed in constraint transformation. This process naturally corresponds to chart parsing. Finally, these two aspects naturally fit each other in our constraint-based approach, unlike most NLP systems, which have distinct procedure modules to deal with the above two aspects of parsing and make them interact Some examples are provided which demonstrate homogeneous treatment of feature structure and phrase structure. |
| Beschreibung: | 7 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010960262 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960923s1990 |||| 00||| engod | ||
| 035 | |a (OCoLC)25854280 | ||
| 035 | |a (DE-599)BVBBV010960262 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Tsuda, Hiroshi |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Parsing as constraint transformation |b an extension of cu-Prolog |c by H. Tsuda & K. Hasida |
| 264 | 1 | |a Tokyo, Japan |c 1990 | |
| 300 | |a 7 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 memorandum |v 984 | |
| 520 | 3 | |a Abstract: "Natural language processing involves a very complex flow of information which cannot be stipulated in terms of procedural programs. This necessitates some sort of constraint programming. In order to embody this picture, we have developed a constraint logic programming (CLP) language cu-Prolog. Unlike most CLP systems, cu-Prolog allows user- defined and dynamically defined predicates to represent symbolic/combinatorial constraints. The constraint satisfaction in cu- Prolog is regarded as a sort of unfold/fold transformation of logic programming. This paper extends cu-Prolog and presents a constraint-based approach to sentence comprehension | |
| 520 | 3 | |a First, local constraints on the feature structure of categories of the unification-based grammar such as HPSG and JPSG are treated as constraints of cu-Prolog. In this respect, mainly feature constraint is processed not as procedures but as constraints. Second, the constraint transformation method is extended here, by incorporating global variables and a tabulation technique, so that parsing of a context-free language is subsumed in constraint transformation. This process naturally corresponds to chart parsing. Finally, these two aspects naturally fit each other in our constraint-based approach, unlike most NLP systems, which have distinct procedure modules to deal with the above two aspects of parsing and make them interact | |
| 520 | 3 | |a Some examples are provided which demonstrate homogeneous treatment of feature structure and phrase structure. | |
| 650 | 4 | |a Natural language processing | |
| 650 | 4 | |a Parsing (Computer grammar) | |
| 650 | 4 | |a Prolog (Computer program language) | |
| 700 | 1 | |a Hasida, Kôiti |e Verfasser |4 aut | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum |v 984 |w (DE-604)BV010943497 |9 984 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007331922 | ||
Datensatz im Suchindex
| _version_ | 1804125448179810304 |
|---|---|
| any_adam_object | |
| author | Tsuda, Hiroshi Hasida, Kôiti |
| author_facet | Tsuda, Hiroshi Hasida, Kôiti |
| author_role | aut aut |
| author_sort | Tsuda, Hiroshi |
| author_variant | h t ht k h kh |
| building | Verbundindex |
| bvnumber | BV010960262 |
| ctrlnum | (OCoLC)25854280 (DE-599)BVBBV010960262 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02633nam a2200349 cb4500</leader><controlfield tag="001">BV010960262</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960923s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25854280</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010960262</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">Tsuda, Hiroshi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parsing as constraint transformation</subfield><subfield code="b">an extension of cu-Prolog</subfield><subfield code="c">by H. Tsuda & K. Hasida</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">7 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 memorandum</subfield><subfield code="v">984</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Natural language processing involves a very complex flow of information which cannot be stipulated in terms of procedural programs. This necessitates some sort of constraint programming. In order to embody this picture, we have developed a constraint logic programming (CLP) language cu-Prolog. Unlike most CLP systems, cu-Prolog allows user- defined and dynamically defined predicates to represent symbolic/combinatorial constraints. The constraint satisfaction in cu- Prolog is regarded as a sort of unfold/fold transformation of logic programming. This paper extends cu-Prolog and presents a constraint-based approach to sentence comprehension</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">First, local constraints on the feature structure of categories of the unification-based grammar such as HPSG and JPSG are treated as constraints of cu-Prolog. In this respect, mainly feature constraint is processed not as procedures but as constraints. Second, the constraint transformation method is extended here, by incorporating global variables and a tabulation technique, so that parsing of a context-free language is subsumed in constraint transformation. This process naturally corresponds to chart parsing. Finally, these two aspects naturally fit each other in our constraint-based approach, unlike most NLP systems, which have distinct procedure modules to deal with the above two aspects of parsing and make them interact</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Some examples are provided which demonstrate homogeneous treatment of feature structure and phrase structure.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Natural language processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parsing (Computer grammar)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Prolog (Computer program language)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hasida, Kôiti</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum</subfield><subfield code="v">984</subfield><subfield code="w">(DE-604)BV010943497</subfield><subfield code="9">984</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007331922</subfield></datafield></record></collection> |
| id | DE-604.BV010960262 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:43Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007331922 |
| oclc_num | 25854280 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 7 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum |
| series2 | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum |
| spelling | Tsuda, Hiroshi Verfasser aut Parsing as constraint transformation an extension of cu-Prolog by H. Tsuda & K. Hasida Tokyo, Japan 1990 7 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum 984 Abstract: "Natural language processing involves a very complex flow of information which cannot be stipulated in terms of procedural programs. This necessitates some sort of constraint programming. In order to embody this picture, we have developed a constraint logic programming (CLP) language cu-Prolog. Unlike most CLP systems, cu-Prolog allows user- defined and dynamically defined predicates to represent symbolic/combinatorial constraints. The constraint satisfaction in cu- Prolog is regarded as a sort of unfold/fold transformation of logic programming. This paper extends cu-Prolog and presents a constraint-based approach to sentence comprehension First, local constraints on the feature structure of categories of the unification-based grammar such as HPSG and JPSG are treated as constraints of cu-Prolog. In this respect, mainly feature constraint is processed not as procedures but as constraints. Second, the constraint transformation method is extended here, by incorporating global variables and a tabulation technique, so that parsing of a context-free language is subsumed in constraint transformation. This process naturally corresponds to chart parsing. Finally, these two aspects naturally fit each other in our constraint-based approach, unlike most NLP systems, which have distinct procedure modules to deal with the above two aspects of parsing and make them interact Some examples are provided which demonstrate homogeneous treatment of feature structure and phrase structure. Natural language processing Parsing (Computer grammar) Prolog (Computer program language) Hasida, Kôiti Verfasser aut Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum 984 (DE-604)BV010943497 984 |
| spellingShingle | Tsuda, Hiroshi Hasida, Kôiti Parsing as constraint transformation an extension of cu-Prolog Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum Natural language processing Parsing (Computer grammar) Prolog (Computer program language) |
| title | Parsing as constraint transformation an extension of cu-Prolog |
| title_auth | Parsing as constraint transformation an extension of cu-Prolog |
| title_exact_search | Parsing as constraint transformation an extension of cu-Prolog |
| title_full | Parsing as constraint transformation an extension of cu-Prolog by H. Tsuda & K. Hasida |
| title_fullStr | Parsing as constraint transformation an extension of cu-Prolog by H. Tsuda & K. Hasida |
| title_full_unstemmed | Parsing as constraint transformation an extension of cu-Prolog by H. Tsuda & K. Hasida |
| title_short | Parsing as constraint transformation |
| title_sort | parsing as constraint transformation an extension of cu prolog |
| title_sub | an extension of cu-Prolog |
| topic | Natural language processing Parsing (Computer grammar) Prolog (Computer program language) |
| topic_facet | Natural language processing Parsing (Computer grammar) Prolog (Computer program language) |
| volume_link | (DE-604)BV010943497 |
| work_keys_str_mv | AT tsudahiroshi parsingasconstrainttransformationanextensionofcuprolog AT hasidakoiti parsingasconstrainttransformationanextensionofcuprolog |