Completeness conditions for mixed strategy context free parsing:
Abstract: "It has been suggested that, in certain circumstances, it might be useful for a grammar-writer to indicate which rules are to be used bottom-up and which are to be used top-down within a parser. One limitation of this technique is that certain allocations of rules to these classes can...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1995
|
| Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
763 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "It has been suggested that, in certain circumstances, it might be useful for a grammar-writer to indicate which rules are to be used bottom-up and which are to be used top-down within a parser. One limitation of this technique is that certain allocations of rules to these classes can lead to incompleteness; that is, there may be valid analyses of the input string which cannot be found by the parser. We formalise a fairly natural notion of 'mixed strategy' parsing for context free grammars, in which a rule may be top-down, bottom-up, or both, and then define a condition of 'analysability' which is a decidable property of such grammars. Any grammar with this property is provably complete. It is also possible to construct grammars which are not 'analysable' but nevertheless do not lead to analyses being missed during parsing. The property defining this wider class of grammars is undecidable. We conclude with some discussion of the relevance of this work to parsers for processing natural language." |
| Beschreibung: | 32 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011045249 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961108s1995 |||| 00||| engod | ||
| 035 | |a (OCoLC)35127518 | ||
| 035 | |a (DE-599)BVBBV011045249 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Ritchie, Graeme D. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Completeness conditions for mixed strategy context free parsing |c Ritchie, G. |
| 264 | 1 | |a Edinburgh |c 1995 | |
| 300 | |a 32 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |v 763 | |
| 520 | 3 | |a Abstract: "It has been suggested that, in certain circumstances, it might be useful for a grammar-writer to indicate which rules are to be used bottom-up and which are to be used top-down within a parser. One limitation of this technique is that certain allocations of rules to these classes can lead to incompleteness; that is, there may be valid analyses of the input string which cannot be found by the parser. We formalise a fairly natural notion of 'mixed strategy' parsing for context free grammars, in which a rule may be top-down, bottom-up, or both, and then define a condition of 'analysability' which is a decidable property of such grammars. Any grammar with this property is provably complete. It is also possible to construct grammars which are not 'analysable' but nevertheless do not lead to analyses being missed during parsing. The property defining this wider class of grammars is undecidable. We conclude with some discussion of the relevance of this work to parsers for processing natural language." | |
| 650 | 7 | |a Bionics and artificial intelligence |2 sigle | |
| 650 | 7 | |a Linguistics |2 sigle | |
| 650 | 4 | |a Linguistik | |
| 650 | 4 | |a Graph grammars | |
| 650 | 4 | |a Parsing (Computer grammar) | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 763 |w (DE-604)BV010450646 |9 763 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007396342 | ||
Datensatz im Suchindex
| _version_ | 1804125534819450880 |
|---|---|
| any_adam_object | |
| author | Ritchie, Graeme D. |
| author_facet | Ritchie, Graeme D. |
| author_role | aut |
| author_sort | Ritchie, Graeme D. |
| author_variant | g d r gd gdr |
| building | Verbundindex |
| bvnumber | BV011045249 |
| ctrlnum | (OCoLC)35127518 (DE-599)BVBBV011045249 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02122nam a2200337 cb4500</leader><controlfield tag="001">BV011045249</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961108s1995 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35127518</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011045249</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">Ritchie, Graeme D.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Completeness conditions for mixed strategy context free parsing</subfield><subfield code="c">Ritchie, G.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">32 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">University <Edinburgh> / Department of Artificial Intelligence: DAI research paper</subfield><subfield code="v">763</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "It has been suggested that, in certain circumstances, it might be useful for a grammar-writer to indicate which rules are to be used bottom-up and which are to be used top-down within a parser. One limitation of this technique is that certain allocations of rules to these classes can lead to incompleteness; that is, there may be valid analyses of the input string which cannot be found by the parser. We formalise a fairly natural notion of 'mixed strategy' parsing for context free grammars, in which a rule may be top-down, bottom-up, or both, and then define a condition of 'analysability' which is a decidable property of such grammars. Any grammar with this property is provably complete. It is also possible to construct grammars which are not 'analysable' but nevertheless do not lead to analyses being missed during parsing. The property defining this wider class of grammars is undecidable. We conclude with some discussion of the relevance of this work to parsers for processing natural language."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bionics and artificial intelligence</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Linguistics</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Linguistik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph grammars</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parsing (Computer grammar)</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Artificial Intelligence: DAI research paper</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">763</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">763</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007396342</subfield></datafield></record></collection> |
| id | DE-604.BV011045249 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:06Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007396342 |
| oclc_num | 35127518 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 32 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Ritchie, Graeme D. Verfasser aut Completeness conditions for mixed strategy context free parsing Ritchie, G. Edinburgh 1995 32 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 763 Abstract: "It has been suggested that, in certain circumstances, it might be useful for a grammar-writer to indicate which rules are to be used bottom-up and which are to be used top-down within a parser. One limitation of this technique is that certain allocations of rules to these classes can lead to incompleteness; that is, there may be valid analyses of the input string which cannot be found by the parser. We formalise a fairly natural notion of 'mixed strategy' parsing for context free grammars, in which a rule may be top-down, bottom-up, or both, and then define a condition of 'analysability' which is a decidable property of such grammars. Any grammar with this property is provably complete. It is also possible to construct grammars which are not 'analysable' but nevertheless do not lead to analyses being missed during parsing. The property defining this wider class of grammars is undecidable. We conclude with some discussion of the relevance of this work to parsers for processing natural language." Bionics and artificial intelligence sigle Linguistics sigle Linguistik Graph grammars Parsing (Computer grammar) Department of Artificial Intelligence: DAI research paper University <Edinburgh> 763 (DE-604)BV010450646 763 |
| spellingShingle | Ritchie, Graeme D. Completeness conditions for mixed strategy context free parsing Bionics and artificial intelligence sigle Linguistics sigle Linguistik Graph grammars Parsing (Computer grammar) |
| title | Completeness conditions for mixed strategy context free parsing |
| title_auth | Completeness conditions for mixed strategy context free parsing |
| title_exact_search | Completeness conditions for mixed strategy context free parsing |
| title_full | Completeness conditions for mixed strategy context free parsing Ritchie, G. |
| title_fullStr | Completeness conditions for mixed strategy context free parsing Ritchie, G. |
| title_full_unstemmed | Completeness conditions for mixed strategy context free parsing Ritchie, G. |
| title_short | Completeness conditions for mixed strategy context free parsing |
| title_sort | completeness conditions for mixed strategy context free parsing |
| topic | Bionics and artificial intelligence sigle Linguistics sigle Linguistik Graph grammars Parsing (Computer grammar) |
| topic_facet | Bionics and artificial intelligence Linguistics Linguistik Graph grammars Parsing (Computer grammar) |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT ritchiegraemed completenessconditionsformixedstrategycontextfreeparsing |