Sciweavers

29 search results - page 2 / 6
» Graph parsing with s-graph grammars
Sort
View
TSE
2010
148views more  TSE 2010»
13 years 5 months ago
Program Behavior Discovery and Verification: A Graph Grammar Approach
—Discovering program behaviors and functionalities can ease program comprehension and verification. Existing program analysis approaches have used text mining algorithms to infer...
Chunying Zhao, Jun Kong, Kang Zhang
ACL
2010
13 years 5 months ago
Simple, Accurate Parsing with an All-Fragments Grammar
We present a simple but accurate parser which exploits both large tree fragments and symbol refinement. We parse with all fragments of the training set, in contrast to much recent...
Mohit Bansal, Dan Klein
GG
2004
Springer
14 years 25 days 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
ICCPOL
2009
Springer
14 years 1 days ago
Processing of Korean Natural Language Queries Using Local Grammars
Abstract. For casual web users, a natural language is more accessible than formal query languages. However, understanding of a natural language query is not trivial for computer sy...
Tae-Gil Noh, Yong-Jin Han, Seong-Bae Park, Se-Youn...
MOZ
2004
Springer
14 years 24 days ago
The XDG Grammar Development Kit
Abstract. Extensible Dependency Grammar (XDG) is a graph description language whose formulas can be solved by constraint programming. XDG is designed so as to yield a declarative a...
Ralph Debusmann, Denys Duchier, Joachim Niehren