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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
|
Source: link-grammar
Section: text
Priority: optional
Maintainer: Jonas Smedegaard <dr@jones.dk>
Build-Depends:
ant [!hppa !hurd-i386 !kfreebsd-amd64 !kfreebsd-i386 !m68k !sh4],
autoconf-archive,
d-shlibs (>= 0.98~),
debhelper-compat (= 13),
default-jdk [!hppa !hurd-i386 !kfreebsd-amd64 !kfreebsd-i386 !m68k !sh4],
dh-sequence-python3,
flex,
hunspell,
libedit-dev,
libhunspell-dev,
libpcre2-dev,
libsqlite3-dev,
locales-all <!nocheck>,
minisat,
pkg-config,
python3-all-dev,
swig,
zlib1g-dev,
Standards-Version: 4.5.1
Homepage: https://www.abisource.com/projects/link-grammar/
Vcs-Browser: https://salsa.debian.org/debian/link-grammar
Vcs-Git: https://salsa.debian.org/debian/link-grammar.git
Rules-Requires-Root: no
Package: link-grammar
Architecture: any
Depends:
link-grammar-dictionaries-en,
${misc:Depends},
${shlibs:Depends},
Description: Carnegie Mellon University's link grammar parser
In Sleator, D. and Temperley, D. "Parsing English with a Link Grammar"
(1991), the authors defined a new formal grammatical system called a
"link grammar". A sequence of words is in the language of a link
grammar if there is a way to draw "links" between words in such a way
that the local requirements of each word are satisfied, the links do
not cross, and the words form a connected graph. The authors encoded
English grammar into such a system, and wrote this program to parse
English using this grammar.
.
link-grammar can be used for linguistic parsing for information
retrieval or extraction from natural language documents. It can also be
used as a grammar checker.
.
This package contains the user-executable binary.
Package: liblink-grammar5
Section: libs
Architecture: any
Multi-Arch: same
Depends:
link-grammar-dictionaries-en,
minisat,
${misc:Depends},
${shlibs:Depends},
Suggests:
link-grammar-dictionaries-all,
Description: Carnegie Mellon University's link grammar parser (libraries)
In Sleator, D. and Temperley, D. "Parsing English with a Link Grammar"
(1991), the authors defined a new formal grammatical system called a
"link grammar". A sequence of words is in the language of a link
grammar if there is a way to draw "links" between words in such a way
that the local requirements of each word are satisfied, the links do
not cross, and the words form a connected graph. The authors encoded
English grammar into such a system, and wrote this program to parse
English using this grammar.
.
link-grammar can be used for linguistic parsing for information
retrieval or extraction from natural language documents. It can also be
used as a grammar checker.
.
This package contains the shared library.
Package: liblink-grammar-dev
Section: libdevel
Architecture: any
Multi-Arch: same
Depends:
liblink-grammar5 (= ${binary:Version}),
${devlibs:Depends},
${misc:Depends},
Breaks:
liblink-grammar4-dev (<< 5.3.7),
Replaces:
liblink-grammar4-dev (<< 5.3.7),
Description: Carnegie Mellon University's link grammar parser (development headers)
In Sleator, D. and Temperley, D. "Parsing English with a Link Grammar"
(1991), the authors defined a new formal grammatical system called a
"link grammar". A sequence of words is in the language of a link
grammar if there is a way to draw "links" between words in such a way
that the local requirements of each word are satisfied, the links do
not cross, and the words form a connected graph. The authors encoded
English grammar into such a system, and wrote this program to parse
English using this grammar.
.
link-grammar can be used for linguistic parsing for information
retrieval or extraction from natural language documents. It can also be
used as a grammar checker.
.
This package contains the header files and static libraries
Package: liblink-grammar-java
Section: java
Architecture: alpha amd64 arm64 armel armhf i386 ia64 mips mips64 mips64el mipsel powerpc powerpcspe ppc64 ppc64el s390x sparc sparc64 x32
Depends:
liblink-grammar5,
${misc:Depends},
${shlibs:Depends},
Breaks:
liblink-grammar4-java (<< 5.3.7),
Replaces:
liblink-grammar4-java (<< 5.3.7),
Description: Carnegie Mellon University's link grammar parser (JNI library)
In Sleator, D. and Temperley, D. "Parsing English with a Link Grammar"
(1991), the authors defined a new formal grammatical system called a
"link grammar". A sequence of words is in the language of a link
grammar if there is a way to draw "links" between words in such a way
that the local requirements of each word are satisfied, the links do
not cross, and the words form a connected graph. The authors encoded
English grammar into such a system, and wrote this program to parse
English using this grammar.
.
link-grammar can be used for linguistic parsing for information
retrieval or extraction from natural language documents. It can also be
used as a grammar checker.
.
This package contains a Java JNI library for using link-grammar from your java
applications.
Package: python3-link-grammar
Architecture: any
Section: python
Depends:
liblink-grammar5,
${misc:Depends},
${python3:Depends},
${shlibs:Depends},
Recommends:
link-grammar-dictionaries-all,
python-link-grammar-examples,
Description: Carnegie Mellon University's link grammar parser (Python 3)
In Sleator, D. and Temperley, D. "Parsing English with a Link Grammar"
(1991), the authors defined a new formal grammatical system called a
"link grammar". A sequence of words is in the language of a link
grammar if there is a way to draw "links" between words in such a way
that the local requirements of each word are satisfied, the links do
not cross, and the words form a connected graph. The authors encoded
English grammar into such a system, and wrote this program to parse
English using this grammar.
.
link-grammar can be used for linguistic parsing for information
retrieval or extraction from natural language documents. It can also be
used as a grammar checker.
.
This package contains a Python 3 library for using link-grammar.
Package: python-link-grammar-examples
Architecture: all
Multi-Arch: foreign
Section: python
Depends:
${misc:Depends},
Enhances:
python-link-grammar,
python3-link-grammar,
Description: CMU's link grammar parser (Python examples)
In Sleator, D. and Temperley, D. "Parsing English with a Link Grammar"
(1991), the authors defined a new formal grammatical system called a
"link grammar". A sequence of words is in the language of a link
grammar if there is a way to draw "links" between words in such a way
that the local requirements of each word are satisfied, the links do
not cross, and the words form a connected graph. The authors encoded
English grammar into such a system, and wrote this program to parse
English using this grammar.
.
link-grammar can be used for linguistic parsing for information
retrieval or extraction from natural language documents. It can also be
used as a grammar checker.
.
This package contains examples for using python-link-grammar or
python3-link-grammar.
Package: link-grammar-dictionaries-en
Architecture: all
Multi-Arch: foreign
Depends:
${misc:Depends},
Description: Carnegie Mellon University's link grammar parser (English dictionary)
In Sleator, D. and Temperley, D. "Parsing English with a Link Grammar"
(1991), the authors defined a new formal grammatical system called a
"link grammar". A sequence of words is in the language of a link
grammar if there is a way to draw "links" between words in such a way
that the local requirements of each word are satisfied, the links do
not cross, and the words form a connected graph. The authors encoded
English grammar into such a system, and wrote this program to parse
English using this grammar.
.
link-grammar can be used for linguistic parsing for information
retrieval or extraction from natural language documents. It can also be
used as a grammar checker.
.
This package contains the English dictionaries.
Package: link-grammar-dictionaries-all
Architecture: all
Multi-Arch: foreign
Depends:
link-grammar-dictionaries-en,
${misc:Depends},
Breaks:
link-grammar-dictionaries-lt (<< 5.3.7),
Replaces:
link-grammar-dictionaries-lt (<< 5.3.7),
Description: Carnegie Mellon University's link grammar parser (all dictionaries)
In Sleator, D. and Temperley, D. "Parsing English with a Link Grammar"
(1991), the authors defined a new formal grammatical system called a
"link grammar". A sequence of words is in the language of a link
grammar if there is a way to draw "links" between words in such a way
that the local requirements of each word are satisfied, the links do
not cross, and the words form a connected graph. The authors encoded
English grammar into such a system, and wrote this program to parse
English using this grammar.
.
link-grammar can be used for linguistic parsing for information
retrieval or extraction from natural language documents. It can also be
used as a grammar checker.
.
This package contains all dictionaries bundled with link-grammar.
|
