Sciweavers

16 search results - page 1 / 4
» Parsing String Generating Hypergraph Grammars
Sort
View
GG
2004
Springer
13 years 10 months ago
Parsing String Generating Hypergraph Grammars
A string generating hypergraph grammar is a hyperedge replacement grammar where the resulting language consists of string graphs i.e. hypergraphs modeling strings. With the help of...
Sebastian Seifert, Ingrid Fischer
IPL
2008
99views more  IPL 2008»
13 years 4 months ago
A CKY parser for picture grammars
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...
Stefano Crespi-Reghizzi, Matteo Pradella
ACL
1992
13 years 6 months ago
Linear Context-Free Rewriting Systems and Deterministic Tree-Walking Transducers
We show that the class of string languages generated by linear context-free rewriting systems is equal to the class of output languages of deterministic treewalking transducers. F...
David J. Weir
EACL
1993
ACL Anthology
13 years 6 months ago
Using an Annotated Corpus as a Stochastic Grammar
In Data Oriented Parsing (DOP), an annotated corpus is used as a stochastic grammar. An input string is parsed by combining subtrees from the corpus. As a consequence, one parse t...
Rens Bod
SAS
2009
Springer
204views Formal Methods» more  SAS 2009»
14 years 5 months ago
Abstract Parsing: Static Analysis of Dynamically Generated String Output Using LR-Parsing Technology
parsing: static analysis of dynamically generated string output using LR-parsing technology Kyung-Goo Doh1 , Hyunha Kim1 , David A. Schmidt2 1 Hanyang University, Ansan, South Kore...
Kyung-Goo Doh, Hyunha Kim, David A. Schmidt