Inference of reversible context-free grammars:
Abstract: "We consider the problem of learning a context-free grammar from examples. We present an efficient algorithm for learning a context-free grammar from positive examples of structural descriptions. Structural descriptions of a context-free grammar are unlabelled parse trees of the gramm...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | Japanese English |
| Published: |
Tokyo, Japan
1988
|
| Series: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum
604 |
| Subjects: | |
| Summary: | Abstract: "We consider the problem of learning a context-free grammar from examples. We present an efficient algorithm for learning a context-free grammar from positive examples of structural descriptions. Structural descriptions of a context-free grammar are unlabelled parse trees of the grammar, the shapes of parse trees. Thus the input to the learning algorithm is a finite set of shapes of parse trees. Our learning algorithm has some desirable features that the output grammar has the intended structure and the algorithm learns a grammar from positive-only examples efficiently. We show that the learning algorithm learns a grammar which is structurally equivalent to the unknown grammar and achieves the polynomial time bound." |
| Physical Description: | 9 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010969753 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960924s1988 |||| 00||| jpnod | ||
| 035 | |a (OCoLC)20977389 | ||
| 035 | |a (DE-599)BVBBV010969753 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a jpn |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Sakakibara, Yasubumi |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Inference of reversible context-free grammars |c by Y. Sakakibara |
| 264 | 1 | |a Tokyo, Japan |c 1988 | |
| 300 | |a 9 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 604 | |
| 520 | 3 | |a Abstract: "We consider the problem of learning a context-free grammar from examples. We present an efficient algorithm for learning a context-free grammar from positive examples of structural descriptions. Structural descriptions of a context-free grammar are unlabelled parse trees of the grammar, the shapes of parse trees. Thus the input to the learning algorithm is a finite set of shapes of parse trees. Our learning algorithm has some desirable features that the output grammar has the intended structure and the algorithm learns a grammar from positive-only examples efficiently. We show that the learning algorithm learns a grammar which is structurally equivalent to the unknown grammar and achieves the polynomial time bound." | |
| 650 | 4 | |a Parsing (Computer grammar) | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum |v 604 |w (DE-604)BV010943497 |9 604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007339535 | ||
Record in the Search Index
| _version_ | 1804125457631674368 |
|---|---|
| any_adam_object | |
| author | Sakakibara, Yasubumi |
| author_facet | Sakakibara, Yasubumi |
| author_role | aut |
| author_sort | Sakakibara, Yasubumi |
| author_variant | y s ys |
| building | Verbundindex |
| bvnumber | BV010969753 |
| ctrlnum | (OCoLC)20977389 (DE-599)BVBBV010969753 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01679nam a2200289 cb4500</leader><controlfield tag="001">BV010969753</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960924s1988 |||| 00||| jpnod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)20977389</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010969753</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">jpn</subfield><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">Sakakibara, Yasubumi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Inference of reversible context-free grammars</subfield><subfield code="c">by Y. Sakakibara</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9 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">604</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We consider the problem of learning a context-free grammar from examples. We present an efficient algorithm for learning a context-free grammar from positive examples of structural descriptions. Structural descriptions of a context-free grammar are unlabelled parse trees of the grammar, the shapes of parse trees. Thus the input to the learning algorithm is a finite set of shapes of parse trees. Our learning algorithm has some desirable features that the output grammar has the intended structure and the algorithm learns a grammar from positive-only examples efficiently. We show that the learning algorithm learns a grammar which is structurally equivalent to the unknown grammar and achieves the polynomial time bound."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parsing (Computer grammar)</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">604</subfield><subfield code="w">(DE-604)BV010943497</subfield><subfield code="9">604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007339535</subfield></datafield></record></collection> |
| id | DE-604.BV010969753 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:52Z |
| institution | BVB |
| language | Japanese English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007339535 |
| oclc_num | 20977389 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 9 S. |
| publishDate | 1988 |
| publishDateSearch | 1988 |
| publishDateSort | 1988 |
| 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 | Sakakibara, Yasubumi Verfasser aut Inference of reversible context-free grammars by Y. Sakakibara Tokyo, Japan 1988 9 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum 604 Abstract: "We consider the problem of learning a context-free grammar from examples. We present an efficient algorithm for learning a context-free grammar from positive examples of structural descriptions. Structural descriptions of a context-free grammar are unlabelled parse trees of the grammar, the shapes of parse trees. Thus the input to the learning algorithm is a finite set of shapes of parse trees. Our learning algorithm has some desirable features that the output grammar has the intended structure and the algorithm learns a grammar from positive-only examples efficiently. We show that the learning algorithm learns a grammar which is structurally equivalent to the unknown grammar and achieves the polynomial time bound." Parsing (Computer grammar) Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum 604 (DE-604)BV010943497 604 |
| spellingShingle | Sakakibara, Yasubumi Inference of reversible context-free grammars Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum Parsing (Computer grammar) |
| title | Inference of reversible context-free grammars |
| title_auth | Inference of reversible context-free grammars |
| title_exact_search | Inference of reversible context-free grammars |
| title_full | Inference of reversible context-free grammars by Y. Sakakibara |
| title_fullStr | Inference of reversible context-free grammars by Y. Sakakibara |
| title_full_unstemmed | Inference of reversible context-free grammars by Y. Sakakibara |
| title_short | Inference of reversible context-free grammars |
| title_sort | inference of reversible context free grammars |
| topic | Parsing (Computer grammar) |
| topic_facet | Parsing (Computer grammar) |
| volume_link | (DE-604)BV010943497 |
| work_keys_str_mv | AT sakakibarayasubumi inferenceofreversiblecontextfreegrammars |