The Linear Arrangement Library. A new tool for research on syntactic dependency structures
Not on the map. Why?
Abstract (arXiv)
The new and growing field of Quantitative Dependency Syntax has emerged at the crossroads between Dependency Syntax and Quantitative Linguistics. One of the main concerns in this field is the statistical patterns of syntactic dependency structures. These structures, grouped in treebanks, are the source for statistical analyses in these and related areas; dozens of scores devised over the years are the tools of a new industry to search for patterns and perform other sorts of analyses. The plethora of such metrics and their increasing complexity require sharing the source code of the programs used to perform such analyses. However, such code is not often shared with the scientific community or is tested following unknown standards. Here we present a new open-source tool, the Linear Arrangement Library (LAL), which caters to the needs of, especially, inexperienced programmers. This tool enables the calculation of these metrics on single syntactic dependency structures, treebanks, and collection of treebanks, grounded on ease of use and yet with great flexibility. LAL has been designed to be efficient, easy to use (while satisfying the needs of all levels of programming expertise), reliable (thanks to thorough testing), and to unite research from different traditions, geographic areas, and research fields.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 11 of its 84 references that are in the map. First posted on arXiv 5 Dec 2021.
Builds on
11 of 84 references.
References · 11
- 2020The optimality of syntactic dependency distancescited by 15
- 2019Anti dependency distance minimization in short sequences. A graph theoretic approachcited by 13
- 2021Minimum projective linearizations of trees in linear timecited by 9
- 2016The scarcity of crossing dependencies: a direct outcome of a specific constraint?cited by 7
- 2017Are crossing dependencies really scarce?cited by 7
- 2019Memory limitations are hidden in grammarcited by 6
- 2021Linear-time calculation of the expected sum of edge lengths in random projective linearizations of treescited by 5
- 2014A stronger null hypothesis for crossing dependenciescited by 3
- 2015A correction on Shiloach's algorithm for minimum linear arrangement of treescited by 3
- 2018A Maximum Linear Arrangement Problem on Directed Graphscited by 2
- 2021Generalized Optimal Linear Orderscited by 1
Built on by
Citing papers per year: 2022: 3; 2023: 1; 2024: 0; 2025: 1.
5 papers.
- 2023Contrasting Linguistic Patterns in Human and LLM-Generated News Textcited by 62
- 2022The distribution of syntactic dependency distancescited by 3
- 2022The expected sum of edge lengths in planar linearizations of trees. Theory and applicationscited by 2
- 2025Better Benchmarking LLMs for Zero-Shot Dependency Parsingcited by 2
- 2022The Maximum Linear Arrangement Problem for trees under projectivity and planaritycited by 0
- 2025Better Benchmarking LLMs for Zero-Shot Dependency Parsing28 Feb 2025
- 2023Contrasting Linguistic Patterns in Human and LLM-Generated News Text17 Aug 2023
- 2022The distribution of syntactic dependency distances26 Nov 2022
- 2022The expected sum of edge lengths in planar linearizations of trees. Theory and applications12 Jul 2022
- 2022The Maximum Linear Arrangement Problem for trees under projectivity and planarity14 Jun 2022