Data augmentation for named entity recognition in the German legal domain

Named Entity Recognition over texts from the legal domain aims to recognize legal entities such as references to legal norms or court decisions. This task is commonly approached with supervised deep learning techniques that require large amounts of training data. However, especially for low-resource languages and specific domains, such training data is often scarce. In this work, we focus on the German legal domain because it is of interest to the Canarėno project, which deals with information extraction from and analysis of legal norms. The objective of the work presented in this thesis is the implementation, evaluation, and comparison of different data augmentation techniques that can be used to expand the available data and thereby improve model performance. Through experiments on different dataset fractions, we show that Mention Replacement and Synonym Replacement can effectively enhance the performance of both recurrent and transformer-based NER models in low-resource environments.Die Anwendung von Named Entity Recognition auf Texte aus dem juristischen Bereich zielt darauf ab, juristische Entitäten wie Referenzen auf Rechtsnormen oder Gerichtsentscheidungen zu erkennen. Diese Aufgabe wird in der Regel mit überwachten Deep-Learning-Techniken angegangen, die große Mengen an Trainingsdaten erfordern. Vor allem für Sprachen mit geringen Ressourcen und für bestimmte Domänen sind solche Trainingsdaten jedoch oft rar. In dieser Arbeit konzentrieren wir uns auf die deutsche Rechtsdomäne, da sie für das Canarėno-Projekt von Interesse ist, das sich mit der Informationsextraktion aus und Analyse von Rechtsnormen beschäftigt. Das Ziel dieser Arbeit ist die Implementierung, Bewertung und der Vergleich verschiedener Techniken, die zur Erweiterung von verfügbaren Daten und damit zur Verbesserung der Modellleistung eingesetzt werden können. Durch Experimente mit verschiedenen Datensatzanteilen zeigen wir, dass Mention Replacement und Synonym Replacement die Leistung von sowohl rekurrenten als auch von transformatorischen NERModellen in ressourcenarmen Umgebungen effektiv verbessern können

Performance guarantees for greedy maximization of non-submodular controllability metrics

A key problem in emerging complex cyber-physical networks is the design of information and control topologies, including sensor and actuator selection and communication network design. These problems can be posed as combinatorial set function optimization problems to maximize a dynamic performance metric for the network. Some systems and control metrics feature a property called submodularity, which allows simple greedy algorithms to obtain provably near-optimal topology designs. However, many important metrics lack submodularity and therefore lack provable guarantees for using a greedy optimization approach. Here we show that performance guarantees can be obtained for greedy maximization of certain non-submodular functions of the controllability and observability Gramians. Our results are based on two key quantities: the submodularity ratio, which quantifies how far a set function is from being submodular, and the curvature, which quantifies how far a set function is from being supermodular

The Ship Of Uncle Sam

https://digitalcommons.library.umaine.edu/mmb-vp/4043/thumbnail.jp

We Carry The Star Spangled Banner Thru The Trenches

https://digitalcommons.library.umaine.edu/mmb-vp/4498/thumbnail.jp

Rainbow Connection Number and Connected Dominating Sets

Rainbow connection number rc(G) of a connected graph G is the minimum number of colours needed to colour the edges of G, so that every pair of vertices is connected by at least one path in which no two edges are coloured the same. In this paper we show that for every connected graph G, with minimum degree at least 2, the rainbow connection number is upper bounded by {\gamma}_c(G) + 2, where {\gamma}_c(G) is the connected domination number of G. Bounds of the form diameter(G) \leq rc(G) \leq diameter(G) + c, 1 \leq c \leq 4, for many special graph classes follow as easy corollaries from this result. This includes interval graphs, AT-free graphs, circular arc graphs, threshold graphs, and chain graphs all with minimum degree at least 2 and connected. We also show that every bridge-less chordal graph G has rc(G) \leq 3.radius(G). In most of these cases, we also demonstrate the tightness of the bounds. An extension of this idea to two-step dominating sets is used to show that for every connected graph on n vertices with minimum degree {\delta}, the rainbow connection number is upper bounded by 3n/({\delta} + 1) + 3. This solves an open problem of Schiermeyer (2009), improving the previously best known bound of 20n/{\delta} by Krivelevich and Yuster (2010). Moreover, this bound is seen to be tight up to additive factors by a construction of Caro et al. (2008).Comment: 14 page

Orthogonal Set of Basis Functions over the Binocular Pupil

Sets of orthogonal basis functions over two-dimensional circular areas--most often representing pupils in optical applications--are known in the literature for the full circle (Zernike or Jacobi polynomials) and the annulus. This work proposes an orthogonal set if the area is two non-overlapping circular pupils of same size. The major free parameter is the ratio of the pupil radii over the distance between both circles. Increasingly higher order aberrations--as defined for a virtual larger pupil in which both pupils are embedded--are fed into a Gram-Schmidt orthogonalization to implement one unique set of basis functions. The key element is to work out the overlap integrals between a full set of primitive basis functions (products of powers of the distance from the mid-point between both pupils by azimuthal functions of the Fourier type).Comment: Added chapters V and VI on interferometric signal and Fourier representatio

Minerals of Indiana

Indiana Geological Survey Bulletin 18Undisturbed Paleozoic sediments form the bedrock surface of Indiana. The most common minerals in these sediments are calcite, clay minerals, dolomite, glauconite, goethite, gypsum, hematite, limonite (hydrous iron oxides), quartz, and siderite. Found less abundantly are anhydrite, apatite, aragonite, barite, celestite, copiapite, epsomite, fluorite, marcasite, melanterite, millerite, pyrite, pyrrhotite, smythite, sphalerite, strontianite, sulfur, and wad. These minerals occur in veins and cavities; along bedding, joint, and fracture surfaces and stylolite seams; and in geodes in limestones. Reported and observed locations and modes of occurrence are presented for each of the minerals except most clay and minerals. The more unusual minerals that occur in glacial materials of Indiana, native copper, diamond, galena, native gold, and native silver, are described in full. A literature study was the basis for a brief discussion of the history of Indiana minerals. The present report questions the reported occurrences in Indiana of native bismuth, graphite, malachite, moissanite, nitromagnesite, and stibnite.Indiana Department of Conservatio

Die Modernisierung des Arbeitsrechts im Korporatistischen Verbund: Entwicklungstendenzen der Verrechtlichung industrieller Beziehungen in der zweiten Hälfte der siebziger Jahre

Seit einiger Zeit beherrschen zwei Begriffe die gewerkschafts- und rechtstheoretische Diskussion: Während im Bereich industriesoziologischer Theoriebildung »Korporatismus« zu scheinbar alles (und häufig nichts) erklärenden Kategorie für den Steuerungsverbund von Gewerkschaften, Unternehmern und Staat avanciert ist (vgl. zusammenfassend Heinze 1981), kursiert in rechtssoziologischen Untersuchungen der Begriff »Verrechtlichung« als Bezeichnung für eine spezifische Strategie staatlicher Regulierung und Kanalisierung gesellschaftlicher Konflikte (Voigt 1980). Ob eine Verbindung dieser beiden (jeweils außerordentlich heterogenen) Konzeptionen einen analytischen Gewinn für die Frage nach der Funktion normativer Regelungen für gewerkschaftliche Handlungsparameter verspricht, wollen die nachfolgenden Überlegungen prüfen. Sie knüpfen an Thesen an und setzen sie voraus, die ich in anderem Zusammenhang ausführlich entwickelt habe (Erd 1978). Was damals empirisch zu belegen versucht wurde und theoretisch mehr einer Ahnung als einer begrifflichen Gewißheit entsprach, scheint sich heute im Rahmen des Korporatismus-Konzepts präzisieren zu lassen