Subgraph Queries by Context-free Grammars
نویسندگان
چکیده
منابع مشابه
Subgraph Queries by Context-free Grammars
We describe a method for querying vertex- and edge-labeled graphs using context-free grammars to specify the class of interesting paths. We introduce a novel problem, finding the connection subgraph induced by the set of matching paths between given two vertices or two sets of vertices. Such a subgraph provides a concise summary of the relationship between the vertices. We also present novel al...
متن کاملGeneralized Queries on Probabilistic Context-Free Grammars
Probabilistic context-free grammars (PCFGs) provide a simple way to represent a particular class of distributions over sentences in a context-free language. Efficient parsing algorithms for answering particular queries about a PCFG (i.e., calculating the probability of a given sentence, or finding the most likely parse) have been developed, and applied to a variety of patternrecognition problem...
متن کاملRecursive Queries and Context-free Graph Grammars
The semantics of a recursive query in the context of a relational database can be formalized in terms ofa context-free graph grammar associated with it. This grammargenerates oriented, labeled hypergraphs. The labels of the hypercdges of these hypergraphs, called the computation graphs of the query, are the names of the relations forming the database under consideration. Some
متن کاملModularized Context-Free Grammars
Given two context-free grammars (CFGs), G 1 and G 2 , the language generated by the union of the grammars is not the union of the languages generated by each grammar: L(G 1 G 2) 6 = L(G 1) L(G 2). In order to account for mod-ularity of grammars, another way of deening the meaning of grammars is needed. This paper adapts results from the semantics of logic programming languages to CFGs. We discu...
متن کاملMultiple Context-Free Grammars
Multiple context-free grammar (MCFG) is a weakly contextsensitive grammar formalism that deals with tuples of strings. An MCFG is called m-MCFG if all tuples have at most m components. In this summary I will outline that the expressivity of m-MCFG’s increases with the parameter m and that the class of tree-adjoining languages is properly included in the class of 2-multiple context-free language...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Integrative Bioinformatics
سال: 2008
ISSN: 1613-4516
DOI: 10.1515/jib-2008-100