mlsanityData to 14 Oct 2026

SPaR.txt, a cheap Shallow Parsing approach for Regulatory texts

arXiv 2110.01295 ↗First posted 4 Oct 2021cs.CLcited by 2

Not on the map. Why?

Abstract (arXiv)

Automated Compliance Checking (ACC) systems aim to semantically parse building regulations to a set of rules. However, semantic parsing is known to be hard and requires large amounts of training data. The complexity of creating such training data has led to research that focuses on small sub-tasks, such as shallow parsing or the extraction of a limited subset of rules. This study introduces a shallow parsing task for which training data is relatively cheap to create, with the aim of learning a lexicon for ACC. We annotate a small domain-specific dataset of 200 sentences, SPaR.txt, and train a sequence tagger that achieves 79,93 F1-score on the test set. We then show through manual evaluation that the model identifies most (89,84%) defined terms in a set of building regulation documents, and that both contiguous and discontiguous Multi-Word Expressions (MWE) are discovered with reasonable accuracy (70,3%).

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 9 of its 68 references that are in the map. First posted on arXiv 4 Oct 2021.

Builds on

9 of 68 references.

References · 9

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2018Self-Attention with Relative Position Representationscited by 1,120
  3. 2019SpanBERT: Improving Pre-training by Representing and Predicting Spanscited by 834
  4. 2015Bidirectional LSTM-CRF Models for Sequence Taggingcited by 546
  5. 2018AllenNLP: A Deep Semantic Natural Language Processing Platformcited by 347
  6. 2018Music Transformercited by 211
  7. 2020LEGAL-BERT: The Muppets straight out of Law Schoolcited by 111
  8. 2018Learning to Recognize Discontiguous Entitiescited by 10
  9. 2017Neural Semantic Parsing over Multiple Knowledge-basescited by 8

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 0; 2025: 0; 2026: 1.

2 papers.