Live briefing
Everything about Abstract semantic graph
Abstract syntax representing expressions as graphs
In computer science, an abstract semantic graph (ASG) or term graph is a form of abstract syntax in which an expression of a formal or programming language is represented by a graph whose vertices are the expression's subterms. An ASG is at a higher level of abstraction than an abstract syntax tree, which is used to express the syntactic structure of an expression or program. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Abstract semantic graphA 5-minute orientation
- Skim a recent paper: Semantic structure fusion graph for abstractive dialogue summarizationInfluential work since 2022
- Pick up a classic book: Computational Linguistics and Intelligent Text ProcessingThe most-reprinted book on the subject
- Read the landmark paper: Text summarization based on semantic graphs: an abstract meaning representation graph-to-text deep learning approachCited 24 times
- Go sideways: Abstract syntax treeA closely related topic
- Go sideways: Term graphA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
🆕 Influential since 2022
đź“š Books worth reading
Computational Linguistics and Intelligent Text ProcessingAlexander Gelbukh · 2003
Java software solutionsLewis, John, John E. Lewis Ph. D. · 1997
Introduction to Constraint DatabasesPeter Revesz · 2002
Discrete mathematical structures for computer scienceRonald E. Prother, Ronald E. Prather · 1976
Foundations of Software Science and Computation StructuresFrank Pfenning · 2013
Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson AbramskyBob Coecke · 2013
Foundations of software science and computation structuresFOSSACS 2000 (2000 Berlin, Germany) · 2000
Conceptual ModelingPaolo Atzeni · 2012
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Abstract syntax tree An abstract syntax tree (AST) is a data structure used in computer science to represent the structure of a program or code snippet. It is a tree representation…
- Term graph A term graph is a representation of an expression in a formal language as a generalized graph whose vertices are terms[clarification needed]. Term graphs…
- DMS Software Reengineering Toolkit The DMS Software Reengineering Toolkit is a proprietary set of program transformation tools available for automating custom source program analysis, modificatio…
- Higher-order abstract syntax In computer science, higher-order abstract syntax (abbreviated HOAS) is a technique for the representation of abstract syntax trees for languages with…
- Term (logic) In mathematical logic, a term is an arrangement of dependent/bound symbols that denotes a mathematical object within an expression/formula. In particular…
- Compiler-compiler In computer science, a compiler-compiler or compiler generator is a programming tool that creates a parser, interpreter, or compiler from some form of…
- Semantic dictionary encoding Semantic dictionary encoding (SDE) preserves the full semantic context of source programs while adding further information that can be used for accelerating…
- Tree-adjoining grammar Tree-adjoining grammar (TAG) is a grammar formalism defined by Aravind Joshi. Tree-adjoining grammars are somewhat similar to context-free grammars, but…