Parsing graphs: applying parser combinators to graph traversals.
Daniel KröniRaphael SchweizerPublished in: SCALA@ECOOP (2013)
Keyphrases
- graph theory
- graph representation
- natural language
- graph structure
- penn treebank
- weighted graph
- graph databases
- directed graph
- graph matching
- natural language processing
- graph theoretic
- labeled graphs
- graph mining
- graph structures
- dependency parsing
- graph theoretical
- graph construction
- random graphs
- graph model
- graph partitioning
- adjacency matrix
- graph data
- subgraph isomorphism
- graph properties
- dependency parser
- parse tree
- graph classification
- graph clustering
- series parallel
- natural language parsing
- graph search
- structural pattern recognition
- bipartite graph
- semantic parsing
- wide coverage
- graph isomorphism
- graph grammars
- phrase structure
- graph representations
- reachability queries
- attributed graphs
- connected graphs
- maximum common subgraph
- spanning tree
- random walk
- minimum spanning tree
- undirected graph
- dynamic graph
- structured data
- link grammar
- edge weights
- small world
- graph kernels
- dense subgraphs
- planar graphs
- neighborhood graph
- syntactic and semantic dependencies
- dependency trees
- tree bank
- maximal cliques
- topological information
- real world graphs
- web graph
- semantic analysis
- finding the shortest path
- maximum clique
- query graph
- graph patterns
- information extraction
- syntactic analysis
- massive graphs
- social networks
- graph layout
- pattern mining
- polynomial time complexity
- context free grammars
- stochastic context free grammars
- community discovery