-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdocument.tex
131 lines (114 loc) · 4.81 KB
/
document.tex
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
% LTeX: enabled=false
\pdfminorversion=7
\begin{filecontents*}[overwrite]{\jobname.xmpdata}
\Title{On the Extraction of Lexicalized Grammars\\and Parsing via Supertagging\\for Discontinuous Constituent Structures}
\Author{Thomas Ruprecht}
\Language{en-US}
% \Subject{The abstract or short description.}
% \Keywords{keyword1\sep keyword2\sep keyword3}
\end{filecontents*}
\PassOptionsToPackage{table}{xcolor}
\documentclass[toc=bib,toc=idx]{scrbook}
\usepackage[tt=false]{libertine}
\usepackage{subfiles}
\usepackage[german, english, iso]{isodate}
\input{mathops}
% \usepackage[pdfborderstyle={/S/U/W 1}]{hyperref}
\usepackage[a-1b]{pdfx} % for PDF/A-1b
\hypersetup{pdfborderstyle={/S/U/W 1}}
\usepackage{natbib, paralist, makeidx, xifthen, wrapfig, subcaption, needspace, booktabs, xfp, algorithm, algorithmicx, multirow, doi, etoolbox}
% \usepackage[table]{xcolor}
\usepackage[capitalize,noabbrev,nameinlink]{cleveref}
\usepackage[noend]{algpseudocode}
\bibliographystyle{abbrvnatsc}
\BeforeBeginEnvironment{wrapfigure}{\setlength{\intextsep}{0pt}}
\appto{\theindex}{\spaceskip=.33333em plus .33333em minus .11111em }
\makeindex
% subcaptions with roman literals
\captionsetup[subfigure]{subrefformat=simple, labelformat=simple}
\renewcommand\thesubfigure{(\roman{subfigure})}
\newcommand{\sref}[1]{step (\ref{#1})}
\newcommand{\Sref}[1]{Step (\ref{#1})}
% fix multiple defined references by algorithmicx
% https://tex.stackexchange.com/questions/177025/hyperref-cleveref-and-algpseudocode-same-identifier-warning
\makeatletter
\newcounter{algorithmicH}% New algorithmic-like hyperref counter
\let\oldalgorithmic\algorithmic
\renewcommand{\algorithmic}{%
\stepcounter{algorithmicH}% Step counter
\oldalgorithmic}% Do what was always done with algorithmic environment
\renewcommand{\theHALG@line}{ALG@line.\thealgorithmicH.\arabic{ALG@line}}
\makeatother
% input and output blocks
\newcommand{\Inputs}{\noindent\hspace*{\algorithmicindent}\textbf{Input}}
\newcommand{\Outputs}{\noindent\hspace*{\algorithmicindent}\textbf{Output}}
\newcommand{\IOElem}[2]{\hspace*{\algorithmicindent}\hspace*{\algorithmicindent}\makebox[4em][l]{#1}#2}
% tikz setup
\usepackage{tikz}
\usetikzlibrary{matrix, positioning, fit, decorations.pathreplacing, shapes, calc}
\newcommand{\abrv}[1]{\textsc{#1}}
\NewDocumentCommand{\deflab}{sd<>omo}{%
\IfBooleanTF{#1}{\IfNoValueTF{#5}{\emph{#4}}{\emph{#5}}}{%
\hypertarget{%
\IfNoValueTF{#3}{#4}{#3}%
}{\IfNoValueTF{#5}{\emph{#4}}{\emph{#5}}}}%
\expandafter\index{\IfNoValueF{#2}{#2!}#4}}
\NewDocumentCommand{\deflabs}{sd<>m}{%
\IfBooleanTF{#1}{\emph{#3s}}{\hypertarget{#3}{\emph{#3s}}}%
\expandafter\index{\IfNoValueF{#2}{#2!}#3}}
\NewDocumentCommand{\defabrv}{sd<>mm}{%
\deflab<\IfNoValueF{#2}{#2!}#3>{\emph{short}: #4}[]%
\deflab{#4 (\emph{short for}: #3)}[]%
\IfBooleanF{#1}{(short: }\emph{#4}\IfBooleanF{#1}{)}}
\newcommand{\lcfrs}{linear context-free rewriting system}
\newcommand{\dcp}{definite clause program}
\newcommand{\hg}{hybrid grammar}
\newcommand{\negra}{\abrv{negra}}
\newcommand{\tiger}{\abrv{tiger}}
\newcommand{\dptb}{\abrv{dptb}}
\renewcommand*{\doitext}{\noexpand\textsc{doi}: }
\newcounter{SectionEnvCounter}
\numberwithin{SectionEnvCounter}{section}
\NewDocumentCommand{\parexample}{so}{%
\IfBooleanF{#1}{\bigskip}\noindent%
\textbf{Example \refstepcounter{SectionEnvCounter}\theSectionEnvCounter}%
\IfNoValueF{#2}{\textbf{\space(#2)}}%
\textbf{.}\space%
}
\NewDocumentCommand{\exampleqed}{}{\hfill\ensuremath{\square}}
\setdefaultenum{(i)}{(a)}{}{}
\author{Thomas Ruprecht}
\title{
% Parsing Discontinuous Constituents\\via Supertagging\\with Lexicalized Formal Grammars
On the Extraction of Lexicalized Grammars\\and Parsing via Supertagging\\for Discontinuous Constituent Structures
}
\date{09.\@ Februar 2024}
\theoremstyle{plain}
\theorembodyfont{\upshape}
\theoremsymbol{\ensuremath{\square}}
\theoremseparator{.}
\newtheorem{definition}[SectionEnvCounter]{Definition}
\newtheorem{example}[SectionEnvCounter]{Example}
\theorembodyfont{\slshape}
\newtheorem{lemma}[SectionEnvCounter]{Lemma}
\newtheorem{theorem}[SectionEnvCounter]{Theorem}
\newtheorem{claim}[SectionEnvCounter]{Claim}
\theoremstyle{nonumberplain}
\theorembodyfont{\upshape}
\theoremsymbol{\ensuremath{\blacksquare}}
\newtheorem{proof}{Proof}
\begin{document}
\subfileinclude{title.tex}
\subfileinclude{acknowledgements.tex}
\tableofcontents
\subfileinclude{chapters/introduction.tex}
\subfileinclude{chapters/preliminaries.tex}
\subfileinclude{chapters/grammar-formalisms.tex}
\subfileinclude{chapters/extraction.tex}
\subfileinclude{chapters/parsing.tex}
\subfileinclude{chapters/experiments.tex}
\subfileinclude{chapters/relatedwork.tex}
\subfileinclude{chapters/conclusion.tex}
\printindex
\bibliography{references}
\end{document}