Publication

Grammar-Based Tree Compression

Related concepts (40)
Decompression equipment
There are several categories of decompression equipment used to help divers decompress, which is the process required to allow divers to return to the surface safely after spending time underwater at higher ambient pressures. Decompression obligation for a given must be calculated and monitored to ensure that the risk of decompression sickness is controlled. Some equipment is specifically for these functions, both during planning before the dive and during the dive.
Dependency grammar
Dependency grammar (DG) is a class of modern grammatical theories that are all based on the dependency relation (as opposed to the constituency relation of phrase structure) and that can be traced back primarily to the work of Lucien Tesnière. Dependency is the notion that linguistic units, e.g. words, are connected to each other by directed links. The (finite) verb is taken to be the structural center of clause structure. All other syntactic units (words) are either directly or indirectly connected to the verb in terms of the directed links, which are called dependencies.
Decompression theory
Decompression theory is the study and modelling of the transfer of the inert gas component of breathing gases from the gas in the lungs to the tissues and back during exposure to variations in ambient pressure. In the case of underwater diving and compressed air work, this mostly involves ambient pressures greater than the local surface pressure, but astronauts, high altitude mountaineers, and travellers in aircraft which are not pressurised to sea level pressure, are generally exposed to ambient pressures less than standard sea level atmospheric pressure.
Definite clause grammar
A definite clause grammar (DCG) is a way of expressing grammar, either for natural or formal languages, in a logic programming language such as Prolog. It is closely related to the concept of attribute grammars / affix grammars from which Prolog was originally developed. DCGs are usually associated with Prolog, but similar languages such as Mercury also include DCGs. They are called definite clause grammars because they represent a grammar as a set of definite clauses in first-order logic.
Functional discourse grammar
Functional grammar (FG) and functional discourse grammar (FDG) are grammar models and theories motivated by functional theories of grammar. These theories explain how linguistic utterances are shaped, based on the goals and knowledge of natural language users. In doing so, it contrasts with Chomskyan transformational grammar. Functional discourse grammar has been developed as a successor to functional grammar, attempting to be more psychologically and pragmatically adequate than functional grammar.
Lossy compression
In information technology, lossy compression or irreversible compression is the class of data compression methods that uses inexact approximations and partial data discarding to represent the content. These techniques are used to reduce data size for storing, handling, and transmitting content. The different versions of the photo of the cat on this page show how higher degrees of approximation create coarser images as more details are removed. This is opposed to lossless data compression (reversible data compression) which does not degrade the data.
Decompression sickness
Decompression sickness (abbreviated DCS; also called divers' disease, the bends, aerobullosis, and caisson disease) is a medical condition caused by dissolved gases emerging from solution as bubbles inside the body tissues during decompression. DCS most commonly occurs during or soon after a decompression ascent from underwater diving, but can also result from other causes of depressurisation, such as emerging from a caisson, decompression from saturation, flying in an unpressurised aircraft at high altitude, and extravehicular activity from spacecraft.
Parsing expression grammar
In computer science, a parsing expression grammar (PEG) is a type of analytic formal grammar, i.e. it describes a formal language in terms of a set of rules for recognizing strings in the language. The formalism was introduced by Bryan Ford in 2004 and is closely related to the family of top-down parsing languages introduced in the early 1970s. Syntactically, PEGs also look similar to context-free grammars (CFGs), but they have a different interpretation: the choice operator selects the first match in PEG, while it is ambiguous in CFG.
Categorial grammar
Categorial grammar is a family of formalisms in natural language syntax that share the central assumption that syntactic constituents combine as functions and arguments. Categorial grammar posits a close relationship between the syntax and semantic composition, since it typically treats syntactic categories as corresponding to semantic types. Categorial grammars were developed in the 1930s by Kazimierz Ajdukiewicz and in the 1950s by Yehoshua Bar-Hillel and Joachim Lambek.
Image compression
Image compression is a type of data compression applied to s, to reduce their cost for storage or transmission. Algorithms may take advantage of visual perception and the statistical properties of image data to provide superior results compared with generic data compression methods which are used for other digital data. Image compression may be lossy or lossless. Lossless compression is preferred for archival purposes and often for medical imaging, technical drawings, clip art, or comics.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.