Algebraic construction of parsing schemata:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Mensch-und-Buch-Verl.
2000
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Zugl.: Passau, Univ., Diss., 1999. - Erscheint: 20. Juni 2000 |
| Beschreibung: | X, 223 S. graph. Darst. |
| ISBN: | 389820121X |
Internformat
MARC
| LEADER | 00000nam a22000008c 4500 | ||
|---|---|---|---|
| 001 | BV013210381 | ||
| 003 | DE-604 | ||
| 005 | 20010206 | ||
| 007 | t| | ||
| 008 | 000613s2000 gw d||| m||| 00||| eng d | ||
| 016 | 7 | |a 959169865 |2 DE-101 | |
| 020 | |a 389820121X |c Gb. : DM 44.00, sfr 44.00, S 325.00 |9 3-89820-121-X | ||
| 035 | |a (OCoLC)48478536 | ||
| 035 | |a (DE-599)BVBBV013210381 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-739 | ||
| 050 | 0 | |a QA267.3 | |
| 084 | |a ST 510 |0 (DE-625)143676: |2 rvk | ||
| 100 | 1 | |a Schneider, Karl-Michael |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Algebraic construction of parsing schemata |c vorgelegt von Karl-Michael Schneider |
| 264 | 1 | |a Berlin |b Mensch-und-Buch-Verl. |c 2000 | |
| 300 | |a X, 223 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Zugl.: Passau, Univ., Diss., 1999. - Erscheint: 20. Juni 2000 | ||
| 650 | 7 | |a Algebraische Methode |2 swd | |
| 650 | 7 | |a Syntaktische Analyse |2 swd | |
| 650 | 4 | |a Computational linguistics | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Formal languages | |
| 650 | 4 | |a Parsing (Computer grammar) | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009000749&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-009000749 | |
Datensatz im Suchindex
| _version_ | 1816443516669132800 |
|---|---|
| adam_text |
CONTENTS
1
INTRODUCTION
1
1.1
LANGUAGE,
GRAMMAR,
AND
RECOGNITION
.
2
1.2
PARSING
.
3
1.3
PARSING
ALGORITHMS
.
4
1.4
PARSING
SCHEMATA
.
6
1.5
CORRECTNESS
OF
PARSING
SCHEMATA
.
8
1.6
SOME
OPEN
PROBLEMS
.
8
1.6.1
PARSING
SCHEMATA
FOR
NON-CONTEXT-FREE
GRAMMARS
.
9
1.6.2
NON
DERIVATION-BASED
GRAMMARS
.
11
1.6.3
ALGEBRAIC
PROPERTIES
OF
PARSING
SCHEMATA
.
12
1.7
ALGEBRAIC
CONSTRUCTION
OF
PARSING
SCHEMATA
.
13
1.8
OVERVIEW
.
17
2
PRELIMINARIES
19
2.1
BASIC
NOTIONS
.
19
2.2
LABELLED
TREES
.
21
2.3
OPERATIONS
ON
TREES
.
23
2.4
LICENSING
OF
TREES
.
24
3
BASIC
ALGEBRAIC
STRUCTURES
25
3.1
NONDETERMINISTIC
ALGEBRAS
.
25
3.2
DIRECT
PRODUCTS
OF
NONDETERMINISTIC
ALGEBRAS
.
27
3.3
HOMOMORPHISMS
OF
NONDETERMINISTIC
ALGEBRAS
.
28
3.4
CONGRUENCE
RELATIONS
OF
NONDETERMINISTIC
ALGEBRAS
.
30
3.5
PARTIAL
HOMOMORPHISMS
OF
NONDETERMINISTIC
ALGEBRAS
.
33
3.6
DEDUCTION
SYSTEMS
.
34
3.7
CONSTRUCTION
OF
PARSING
SCHEMATA
.
35
3.8
A
NOTE
ON
TERMINOLOGY
.
36
4
ALGEBRAIC
CONSTRUCTION
OF
PARSING
SCHEMATA
37
4.1
INPUT
SOLUTION
SYSTEMS
.
37
4.2
YIELD
SYSTEMS
.
39
4.3
EXTENDED
YIELD
SYSTEMS
.
41
4.4
TOP-DOWN
AND
BOTTOM-UP
PARSING
.
43
4.5
EQUIVALENCE
CLASSES
OF
SOLUTIONS
.
44
VIII
4.6
SUBSYSTEMS
OF
YIELD
SYSTEMS
.
45
4.7
PARSING
ALGEBRAS
.
46
5
STATE
TRANSITION
GRAMMARS
49
5.1
STATE
TRANSITION
SYSTEMS
.
49
5.2
STATE
TRANSITION
GRAMMARS
.
51
5.3
QUASI
CONTEXT-FREE
GRAMMARS
.
52
5.4
GRAMMAR
REPRESENTATIONS
.
53
5.4.1
CONTEXT-FREE
GRAMMARS
.
54
5.4.2
EXTENDED
CONTEXT-FREE
GRAMMARS
.
54
5.4.3
ID/LP
GRAMMARS
.
55
5.5
STATE
TREES
.
55
5.6
SOME
OPERATIONS
ON
STATE
TREES
.
58
6
GENERAL(IZED)
EARLEY
PARSING
61
6.1
EARLEY
TREES
.
61
6.2
EARLEY
TREE
OPERATIONS
.
64
6.3
CORRECTNESS
.
67
6.3.1
SOUNDNESS
.
67
6.3.2
COMPLETENESS
.
68
6.4
EARLEY
TREE
POSITIONS
.
71
6.5
EARLEY
YIELD
OPERATIONS
.
73
6.6
EARLEY
ALGEBRAS
.
74
6.7
EARLEY
CONGRUENCE
RELATIONS
.
75
6.8
THE
LANGUAGE
L(E(G)/~)
.
77
6.9
THE
EARLEY
SUBALGEBRA
S(G,W)
.
78
6.10
THE
EARLEY
PARSING
SUBALGEBRA
(G,W)/~
.
79
6.11
THE
SYSTEM
OF
EARLEY
PARSING
ALGEBRAS
.
79
7
EARLEY
ITEMS
81
7.1
MOTIVATION
.
81
7.2
EARLEY
ITEMS
.
83
7.3
EARLEY
ITEM
OPERATIONS
.
85
7.4
EARLEY
ITEM
SUBALGEBRA
.
87
7.5
NORMAL
EARLEY
ITEMS
.
88
7.6
NORMAL
EARLEY
ITEM
SUBALGEBRA
FOR
W
.
90
7.7
STANDARD
EARLEY
ITEMS
.
92
7.8
EARLEY
PARSING
SYSTEMS
.
92
7.9
SUMMARY
.
94
8
EARLEY
PARSABILITY
AND
WEAK
EARLEY
PARSABILITY
97
8.1
EARLEY
PARSABILITY
.
97
8.1.1
CONTEXT-FREE
GRAMMARS
.
99
8.1.2
ID/LP
GRAMMARS
.
99
8.1.3
ECFG
ARE
NOT
EARLEY
PARSABLE
.
99
8.2
WEAK
EARLEY
PARSABILITY
.
101
IX
8.3
(WEAK)
EARLEY
PARSABILITY
AND
STRONG/WEAK
EQUIVALENCE
.
102
9
RELATIONS
BETWEEN
PARSING
ALGEBRAS
107
9.1
PARSING
SYSTEMS
.
107
9.2
RELATIONS
BETWEEN
PARSING
SYSTEMS
.
108
9.3
THE
RELATION
BETWEEN
PARSING
ALGEBRAS
AND
PARSING
SCHEMATA
.
108
9.4
RELATIONS
BETWEEN
PARSING
ALGEBRAS
.
110
9.4.1
STATIC
FILTERING
.
ILL
9.4.2
REDUNDANCY
ELIMINATION
.
ILL
9.4.3
DYNAMIC
FILTERING
.
ILL
9.4.4
ITEM
CONTRACTION
.
112
9.4.5
STEP
CONTRACTION
.
113
9.5
EXAMPLE:
EARLEY
-^4
LEFT-CORNER
.
114
9.5.1
LEFT-CORNER
TREE
CONSTRUCTION
.
114
9.5.2
LEFT-CORNER
YIELDS
.
117
9.5.3
LEFT-CORNER
PARSING
ALGEBRA
.
117
10
HEAD-CORNER
PARSING
119
10.1
HEADED
TREES
.
119
10.2
HEADED
STATE
TRANSITION
GRAMMARS
.
121
10.3
HEAD-CORNER
TREES
.
122
10.4
HEAD-CORNER
TREE
OPERATIONS
.
125
10.5
CORRECTNESS
OF
HEAD-CORNER
TREE
OPERATIONS
.
132
10.6
HEAD-CORNER
YIELDS
.
137
10.7
HEAD-CORNER
ALGEBRA
.
137
10.8
THE
CONNECTION
BETWEEN
LC
AND
HC
.
139
11
RELAXATION
OF
TREE
ALGEBRAS
141
11.1
RELAXATION
.
141
11.2
AN
EARLEY
TREE
ALGEBRA
WITH
A
UNARY
COMPLETE
OPERATION
.
144
11.3
BOTTOM-UP
HEAD-CORNER
PARSING
OF
LIG
.
146
11.3.1
BOTTOM-UP
HEAD-CORNER
PARSING
.
147
11.3.2
LINEAR
INDEXED
GRAMMARS
.
149
11.3.3
BOTTOM-UP
HEAD-CORNER
OPERATIONS
FOR
LIG
.
150
11.3.4
RELAXED
BUHC
OPERATIONS
FOR
LIG
.
153
11.3.5
A
CONGRUENCE
RELATION
OF
THE
BUHC(LIG)
TREE
ALGEBRA
WITH
FINITELY
MANY
CONGRUENCE
CLASSES OF
GENERATED
TREES
.
156
11.3.6
THE
BUHC(LIG)
YIELD
.
157
11.3.7
BUHC(LIG)
PARSING
SCHEMA
.
160
11.3.8
DISCUSSION
.
160
12
EARLEY
SCHEMATA
FOR
MODAL(L,*)-GRAMMARS
163
12.1
MODAL(L,*)-GRAMMARS
.
163
12.1.1
MOTIVATION
OF
MODAL(L,*)-GRAMMARS
.
164
12.1.2
TREE
FRAMES
.
165
X
12.1.3
LANGUAGE
AND
TREE
MODELS
.
165
12.1.4
LABELLED
TREE
MODELS
.
167
12.1.5
THE
LOCALITY
DOMAIN
OF
STG
PRODUCTIONS
.
168
12.1.6
MODAL(L,*)-RESTRICTED
FORMULAS
.
169
12.1.7
EXPRESSIVENESS
OF
MODAL(L,*)-RESTRICTED
FORMULAS
.
170
12.1.8
MODAL(L,*)-GRAMMARS
.
171
12.1.9
OVERVIEW
OF
THE
REMAINDER
OF
THE
CHAPTER
.
172
12.2
LABELLED
ANALYTIC
TABLEAUX
FOR
MODAL
LOGIC
.
172
12.3
THE
CONNECTION
BETWEEN
PARSING
AND
ANALYTIC
TABLEAUX
.
174
12.3.1
REACHABILITY
IN
TREE
FRAMES
.
174
12.3.2
LABELLED
TABLEAU
RULES
FOR
LIJG
.
176
12.3.3
SOUNDNESS
OF
CLIJG
.
176
12.3.4
COMPLETENESS
OF
CLJJG
.
179
12.3.5
SYSTEMATIC
CLJJG-TABLEAU
CONSTRUCTION
.
180
12.4
A
LABELLED
TABLEAU
SYSTEM
FOR
LJJG
THAT
CAN
PRODUCE
ANY
TREE
MODEL
182
12.5
ORDERED
TABLEAU
CONSTRUCTION
.
185
12.6
GENERALIZED
TABLEAU
RULES
.
188
12.6.1
GENERALIZED
LABELLED
TABLEAU
RULES
.
188
12.6.2
DERIVED
GENERALIZED
TABLEAU
RULES
.
190
12.7
SUPERTABLEAUX
.
191
12.7.1
TABLEAU
SUPERRULES
.
191
12.7.2
SYSTEMATIC
SUPERTABLEAU
CONSTRUCTION
.
192
12.7.3
SOUNDNESS
AND
COMPLETENESS
OF
SUPERTABLEAUX
.
193
12.8
STG
REPRESENTATIONS
OF
MODAL(L,*)-GRAMMARS
.
195
12.8.1
OVERVIEW
OF
THE
CONSTRUCTION
.
195
12.8.2
CORRESPONDENCE
BETWEEN
STATES
AND
LABELLED
FORMULAS
.
196
12.8.3
THE
ROLE
OF
THE
WL^.E-FORMULA
.
196
12.8.4
DISJUNCTIVE
NORMAL
FORM
.
197
12.8.5
CORRESPONDENCE
BETWEEN
TRANSITIONS
AND
TABLEAU
RULES
.
198
12.8.6
SIMULATION
OF
(S
4/)
AND
(5
-
)
ON
STATES
.
199
12.8.7
STATES
.
199
12.8.8
PRODUCTIONS
.
200
12.8.9
TRANSITIONS
.
201
12.8.10
CORRECTNESS
OF
THE
CONSTRUCTION
.
201
12.8.11
AN
EXAMPLE
.
201
12.9
CONCLUSION
OF
THE
CHAPTER
.
202
13
CONCLUSION
205
13.1
CONTRIBUTIONS
OF
THIS
WORK
.
205
13.2
IDEAS
FOR
FUTURE
WORK
.
207
BIBLIOGRAPHY
209
INDEX
213 |
| any_adam_object | 1 |
| author | Schneider, Karl-Michael |
| author_facet | Schneider, Karl-Michael |
| author_role | aut |
| author_sort | Schneider, Karl-Michael |
| author_variant | k m s kms |
| building | Verbundindex |
| bvnumber | BV013210381 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267.3 |
| callnumber-search | QA267.3 |
| callnumber-sort | QA 3267.3 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 510 |
| ctrlnum | (OCoLC)48478536 (DE-599)BVBBV013210381 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a22000008c 4500</leader><controlfield tag="001">BV013210381</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20010206</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">000613s2000 gw d||| m||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">959169865</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">389820121X</subfield><subfield code="c">Gb. : DM 44.00, sfr 44.00, S 325.00</subfield><subfield code="9">3-89820-121-X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)48478536</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013210381</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267.3</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 510</subfield><subfield code="0">(DE-625)143676:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Schneider, Karl-Michael</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algebraic construction of parsing schemata</subfield><subfield code="c">vorgelegt von Karl-Michael Schneider</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Mensch-und-Buch-Verl.</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 223 S.</subfield><subfield code="b">graph. Darst.</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="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Passau, Univ., Diss., 1999. - Erscheint: 20. Juni 2000</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algebraische Methode</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Syntaktische Analyse</subfield><subfield code="2">swd</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational linguistics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formal languages</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parsing (Computer grammar)</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009000749&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009000749</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV013210381 |
| illustrated | Illustrated |
| indexdate | 2024-11-22T17:12:06Z |
| institution | BVB |
| isbn | 389820121X |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009000749 |
| oclc_num | 48478536 |
| open_access_boolean | |
| owner | DE-739 |
| owner_facet | DE-739 |
| physical | X, 223 S. graph. Darst. |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | Mensch-und-Buch-Verl. |
| record_format | marc |
| spelling | Schneider, Karl-Michael Verfasser aut Algebraic construction of parsing schemata vorgelegt von Karl-Michael Schneider Berlin Mensch-und-Buch-Verl. 2000 X, 223 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Zugl.: Passau, Univ., Diss., 1999. - Erscheint: 20. Juni 2000 Algebraische Methode swd Syntaktische Analyse swd Computational linguistics Computer algorithms Formal languages Parsing (Computer grammar) (DE-588)4113937-9 Hochschulschrift gnd-content DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009000749&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Schneider, Karl-Michael Algebraic construction of parsing schemata Algebraische Methode swd Syntaktische Analyse swd Computational linguistics Computer algorithms Formal languages Parsing (Computer grammar) |
| subject_GND | (DE-588)4113937-9 |
| title | Algebraic construction of parsing schemata |
| title_auth | Algebraic construction of parsing schemata |
| title_exact_search | Algebraic construction of parsing schemata |
| title_full | Algebraic construction of parsing schemata vorgelegt von Karl-Michael Schneider |
| title_fullStr | Algebraic construction of parsing schemata vorgelegt von Karl-Michael Schneider |
| title_full_unstemmed | Algebraic construction of parsing schemata vorgelegt von Karl-Michael Schneider |
| title_short | Algebraic construction of parsing schemata |
| title_sort | algebraic construction of parsing schemata |
| topic | Algebraische Methode swd Syntaktische Analyse swd Computational linguistics Computer algorithms Formal languages Parsing (Computer grammar) |
| topic_facet | Algebraische Methode Syntaktische Analyse Computational linguistics Computer algorithms Formal languages Parsing (Computer grammar) Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009000749&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT schneiderkarlmichael algebraicconstructionofparsingschemata |