In this page you will find user guides of the Linear Arrangement Library. These are classified by version number.
Version 24.10
Quick guide (Python). Introductory guide to LAL.
- Introduction to LAL (contains installation instructions for Windows users)
- Working with single trees (construction of trees; calculation of scores on single trees)
- Working with treebanks and treebank collections (contains hints on efficiency for faster processing).
Advanced guide (Python). A guide to calculating random baselines and hypothesis testing with LAL.
- Random and exhaustive generation of trees (the 8 combinations of exhaustive/random unlabeled/labeled free/rooted trees).
- Random and exhaustive generation of linear arrangements (following three formal constraints: projectivity, planarity, and unconstrained arrangements).
Version 23.01
Quick guide (Python). Introductory guide to LAL.
- Introduction to LAL (contains installation instructions for Windows users)
- Working with single trees (construction of trees; calculation of scores on single trees)
- Working with treebanks and treebank collections (contains hints on efficiency for faster processing).
Advanced guide (Python). A guide to calculating random baselines and hypothesis testing with LAL.
- Random and exhaustive generation of trees (the 8 combinations of exhaustive/random unlabeled/labeled free/rooted trees).
- Random and exhaustive generation of linear arrangements (following three formal constraints: projectivity, planarity, and unconstrained arrangements).
Version 21.07
Quick guide (Python). Introductory guide to LAL.
- Introduction to LAL (contains installation instructions for Windows users)
- Working with single trees (construction of trees; calculation of scores on single trees)
- Working with treebanks and treebank collections (contains hints on efficiency for faster processing).
Advanced guide (Python). A guide to calculating random baselines and hypothesis testing with LAL.
- Random and exhaustive generation of trees (the 8 combinations of exhaustive/random unlabeled/labeled free/rooted trees).
- Random and exhaustive generation of linear arrangements (following three formal constraints: projectivity, planarity, and unconstrained arrangements) .