DoubleTreeJS + Metadata demo, © 2012-2016 Chris Culy

The preloaded text is from three versions of Robin Hood, one by Howard Pyle (P), one by Paul Creswick (C), and one by J. Walker McSpadden (M). The nodes show the lemma and the corresponding tokens. Nodes are shown with a background color if the lemma occurs in only one of the texts in the current context: for P, for C, and for M. Nodes have a box around them if the lemma occurs in all of the texts in the current context. Uncolored nodes with no box occur in two of the three texts in the current context. Alt-click on a node to make it the center. Shift-click on a node to get a KWIC view below. Move the tree by dragging on a node or the branches. The input boxes accept regular expressions. Experiment! Feedback appreciated.

Input file: Lemma to use: or from history
Sort branches by: lemma POS branching
Limit first left POS to:
Limit first right POS to:
Show POS