Text-Fabric v8.3.4: Text-Fabric with a new display algorithm

TY - ADVS

T1 - Text-Fabric v8.3.4

T2 - Text-Fabric with a new display algorithm

A2 - Roorda, Dirk

PY - 2020/6/26

Y1 - 2020/6/26

N2 - In Text-Fabric we want to display pieces of corpus material in insightful ways.We have implemented two types of displaying:plain: almost as the plain text of nodes, but with optional in-line formattingpretty: almost as a tree-bank view, but for the fact that the text objects are not merely trees, but graphs.In both types of display it is possible to optionally show node numbers to the relevant pieces of text, and to highlight nodes.In addition to highlighting, the displays can be tweaked by passing a fair number of options, in order to show of hide features of nodes, call in additional graphics, show or hide intermediate levels, etc.Whatever we want to display, we have to display in HTML, which is basically a hierarchically organized set of presentation elements.But a node and its constellation of relevant neighbourhood nodes does not have a hierarchical structure, in general, that is.The unravel algorithm solves the problem of turning a node and its associated piece of the textual graph into a tree of node fragments in such a way that the order of the slots is preserved.

AB - In Text-Fabric we want to display pieces of corpus material in insightful ways.We have implemented two types of displaying:plain: almost as the plain text of nodes, but with optional in-line formattingpretty: almost as a tree-bank view, but for the fact that the text objects are not merely trees, but graphs.In both types of display it is possible to optionally show node numbers to the relevant pieces of text, and to highlight nodes.In addition to highlighting, the displays can be tweaked by passing a fair number of options, in order to show of hide features of nodes, call in additional graphics, show or hide intermediate levels, etc.Whatever we want to display, we have to display in HTML, which is basically a hierarchically organized set of presentation elements.But a node and its constellation of relevant neighbourhood nodes does not have a hierarchical structure, in general, that is.The unravel algorithm solves the problem of turning a node and its associated piece of the textual graph into a tree of node fragments in such a way that the order of the slots is preserved.

KW - annotation

KW - corpus analysis

KW - text-fabric

KW - search engine

KW - python

KW - text modeling

KW - hebrew

KW - cuneiform

KW - arabic

KW - greek

UR - https://github.com/annotation/text-fabric

UR - https://archive.softwareheritage.org/browse/origin/directory/?origin_url=https://github.com/annotation/text-fabric

U2 - 10.5281/zenodo.3909582

DO - 10.5281/zenodo.3909582

M3 - Software

PB - Zenodo

ER -