| 1 |
Source: link-grammar |
| 2 |
Section: text |
| 3 |
Priority: optional |
| 4 |
Maintainer: Jonas Smedegaard <[email protected]> |
| 5 |
Build-Depends: |
| 6 |
# autogenerated: DEB_MAINTAINER_MODE=1 debian/rules clean |
| 7 |
ant [amd64 arm64 armel armhf i386 mips64el ppc64el riscv64 s390x], |
| 8 |
autoconf-archive, |
| 9 |
d-shlibs (>= 0.106~), |
| 10 |
debhelper-compat (= 13), |
| 11 |
# autogenerated: DEB_MAINTAINER_MODE=1 debian/rules clean |
| 12 |
default-jdk [amd64 arm64 armel armhf i386 mips64el ppc64el riscv64 s390x], |
| 13 |
dh-sequence-python3, |
| 14 |
flex, |
| 15 |
hunspell, |
| 16 |
libedit-dev, |
| 17 |
libhunspell-dev, |
| 18 |
libpcre2-dev, |
| 19 |
libsqlite3-dev, |
| 20 |
locales-all <!nocheck>, |
| 21 |
pkgconf, |
| 22 |
python3-dev, |
| 23 |
swig, |
| 24 |
zlib1g-dev, |
| 25 |
Standards-Version: 4.7.2 |
| 26 |
Homepage: https://www.abisource.com/projects/link-grammar/ |
| 27 |
Vcs-Browser: https://salsa.debian.org/debian/link-grammar |
| 28 |
Vcs-Git: https://salsa.debian.org/debian/link-grammar.git |
| 29 |
Rules-Requires-Root: no |
| 30 |
|
| 31 |
Package: link-grammar |
| 32 |
Architecture: any |
| 33 |
Depends: |
| 34 |
link-grammar-dictionaries-en, |
| 35 |
${misc:Depends}, |
| 36 |
${shlibs:Depends}, |
| 37 |
Description: Carnegie Mellon University's link grammar parser |
| 38 |
In Sleator, D. and Temperley, D. "Parsing English with a Link Grammar" |
| 39 |
(1991), the authors defined a new formal grammatical system called a |
| 40 |
"link grammar". A sequence of words is in the language of a link |
| 41 |
grammar if there is a way to draw "links" between words in such a way |
| 42 |
that the local requirements of each word are satisfied, the links do |
| 43 |
not cross, and the words form a connected graph. The authors encoded |
| 44 |
English grammar into such a system, and wrote this program to parse |
| 45 |
English using this grammar. |
| 46 |
. |
| 47 |
link-grammar can be used for linguistic parsing for information |
| 48 |
retrieval or extraction from natural language documents. It can also be |
| 49 |
used as a grammar checker. |
| 50 |
. |
| 51 |
This package contains the user-executable binary. |
| 52 |
|
| 53 |
Package: liblink-grammar5t64 |
| 54 |
Section: libs |
| 55 |
Architecture: any |
| 56 |
Multi-Arch: same |
| 57 |
Depends: |
| 58 |
link-grammar-dictionaries-en, |
| 59 |
minisat, |
| 60 |
${misc:Depends}, |
| 61 |
${shlibs:Depends}, |
| 62 |
Suggests: |
| 63 |
link-grammar-dictionaries-all, |
| 64 |
Provides: |
| 65 |
${t64:Provides}, |
| 66 |
Replaces: |
| 67 |
liblink-grammar5, |
| 68 |
Conflicts: |
| 69 |
liblink-grammar5 (<< ${source:Version}), |
| 70 |
Description: Carnegie Mellon University's link grammar parser (libraries) |
| 71 |
In Sleator, D. and Temperley, D. "Parsing English with a Link Grammar" |
| 72 |
(1991), the authors defined a new formal grammatical system called a |
| 73 |
"link grammar". A sequence of words is in the language of a link |
| 74 |
grammar if there is a way to draw "links" between words in such a way |
| 75 |
that the local requirements of each word are satisfied, the links do |
| 76 |
not cross, and the words form a connected graph. The authors encoded |
| 77 |
English grammar into such a system, and wrote this program to parse |
| 78 |
English using this grammar. |
| 79 |
. |
| 80 |
link-grammar can be used for linguistic parsing for information |
| 81 |
retrieval or extraction from natural language documents. It can also be |
| 82 |
used as a grammar checker. |
| 83 |
. |
| 84 |
This package contains the shared library. |
| 85 |
|
| 86 |
Package: liblink-grammar-dev |
| 87 |
Section: libdevel |
| 88 |
Architecture: any |
| 89 |
Multi-Arch: no |
| 90 |
Depends: |
| 91 |
liblink-grammar5t64 (= ${binary:Version}), |
| 92 |
${devlibs:Depends}, |
| 93 |
${misc:Depends}, |
| 94 |
Description: Carnegie Mellon University's link grammar parser (development headers) |
| 95 |
In Sleator, D. and Temperley, D. "Parsing English with a Link Grammar" |
| 96 |
(1991), the authors defined a new formal grammatical system called a |
| 97 |
"link grammar". A sequence of words is in the language of a link |
| 98 |
grammar if there is a way to draw "links" between words in such a way |
| 99 |
that the local requirements of each word are satisfied, the links do |
| 100 |
not cross, and the words form a connected graph. The authors encoded |
| 101 |
English grammar into such a system, and wrote this program to parse |
| 102 |
English using this grammar. |
| 103 |
. |
| 104 |
link-grammar can be used for linguistic parsing for information |
| 105 |
retrieval or extraction from natural language documents. It can also be |
| 106 |
used as a grammar checker. |
| 107 |
. |
| 108 |
This package contains the header files and static libraries |
| 109 |
|
| 110 |
Package: liblink-grammar-java |
| 111 |
# autogenerated: DEB_MAINTAINER_MODE=1 debian/rules clean |
| 112 |
Architecture: amd64 arm64 armel armhf i386 mips64el ppc64el riscv64 s390x |
| 113 |
Section: java |
| 114 |
Depends: |
| 115 |
liblink-grammar5t64, |
| 116 |
${misc:Depends}, |
| 117 |
${shlibs:Depends}, |
| 118 |
Description: Carnegie Mellon University's link grammar parser (JNI library) |
| 119 |
In Sleator, D. and Temperley, D. "Parsing English with a Link Grammar" |
| 120 |
(1991), the authors defined a new formal grammatical system called a |
| 121 |
"link grammar". A sequence of words is in the language of a link |
| 122 |
grammar if there is a way to draw "links" between words in such a way |
| 123 |
that the local requirements of each word are satisfied, the links do |
| 124 |
not cross, and the words form a connected graph. The authors encoded |
| 125 |
English grammar into such a system, and wrote this program to parse |
| 126 |
English using this grammar. |
| 127 |
. |
| 128 |
link-grammar can be used for linguistic parsing for information |
| 129 |
retrieval or extraction from natural language documents. It can also be |
| 130 |
used as a grammar checker. |
| 131 |
. |
| 132 |
This package contains a Java JNI library for using link-grammar from your java |
| 133 |
applications. |
| 134 |
|
| 135 |
Package: python3-link-grammar |
| 136 |
Architecture: any |
| 137 |
Section: python |
| 138 |
Depends: |
| 139 |
liblink-grammar5t64, |
| 140 |
${misc:Depends}, |
| 141 |
${python3:Depends}, |
| 142 |
${shlibs:Depends}, |
| 143 |
Recommends: |
| 144 |
link-grammar-dictionaries-all, |
| 145 |
python-link-grammar-examples, |
| 146 |
Description: Carnegie Mellon University's link grammar parser (Python 3) |
| 147 |
In Sleator, D. and Temperley, D. "Parsing English with a Link Grammar" |
| 148 |
(1991), the authors defined a new formal grammatical system called a |
| 149 |
"link grammar". A sequence of words is in the language of a link |
| 150 |
grammar if there is a way to draw "links" between words in such a way |
| 151 |
that the local requirements of each word are satisfied, the links do |
| 152 |
not cross, and the words form a connected graph. The authors encoded |
| 153 |
English grammar into such a system, and wrote this program to parse |
| 154 |
English using this grammar. |
| 155 |
. |
| 156 |
link-grammar can be used for linguistic parsing for information |
| 157 |
retrieval or extraction from natural language documents. It can also be |
| 158 |
used as a grammar checker. |
| 159 |
. |
| 160 |
This package contains a Python 3 library for using link-grammar. |
| 161 |
|
| 162 |
Package: python-link-grammar-examples |
| 163 |
Architecture: all |
| 164 |
Multi-Arch: foreign |
| 165 |
Section: python |
| 166 |
Depends: |
| 167 |
${misc:Depends}, |
| 168 |
Enhances: |
| 169 |
python-link-grammar, |
| 170 |
python3-link-grammar, |
| 171 |
Description: CMU's link grammar parser (Python examples) |
| 172 |
In Sleator, D. and Temperley, D. "Parsing English with a Link Grammar" |
| 173 |
(1991), the authors defined a new formal grammatical system called a |
| 174 |
"link grammar". A sequence of words is in the language of a link |
| 175 |
grammar if there is a way to draw "links" between words in such a way |
| 176 |
that the local requirements of each word are satisfied, the links do |
| 177 |
not cross, and the words form a connected graph. The authors encoded |
| 178 |
English grammar into such a system, and wrote this program to parse |
| 179 |
English using this grammar. |
| 180 |
. |
| 181 |
link-grammar can be used for linguistic parsing for information |
| 182 |
retrieval or extraction from natural language documents. It can also be |
| 183 |
used as a grammar checker. |
| 184 |
. |
| 185 |
This package contains examples for using python-link-grammar or |
| 186 |
python3-link-grammar. |
| 187 |
|
| 188 |
Package: link-grammar-dictionaries-en |
| 189 |
Architecture: all |
| 190 |
Multi-Arch: foreign |
| 191 |
Depends: |
| 192 |
${misc:Depends}, |
| 193 |
Description: Carnegie Mellon University's link grammar parser (English dictionary) |
| 194 |
In Sleator, D. and Temperley, D. "Parsing English with a Link Grammar" |
| 195 |
(1991), the authors defined a new formal grammatical system called a |
| 196 |
"link grammar". A sequence of words is in the language of a link |
| 197 |
grammar if there is a way to draw "links" between words in such a way |
| 198 |
that the local requirements of each word are satisfied, the links do |
| 199 |
not cross, and the words form a connected graph. The authors encoded |
| 200 |
English grammar into such a system, and wrote this program to parse |
| 201 |
English using this grammar. |
| 202 |
. |
| 203 |
link-grammar can be used for linguistic parsing for information |
| 204 |
retrieval or extraction from natural language documents. It can also be |
| 205 |
used as a grammar checker. |
| 206 |
. |
| 207 |
This package contains the English dictionaries. |
| 208 |
|
| 209 |
Package: link-grammar-dictionaries-all |
| 210 |
Architecture: all |
| 211 |
Multi-Arch: foreign |
| 212 |
Depends: |
| 213 |
link-grammar-dictionaries-en, |
| 214 |
${misc:Depends}, |
| 215 |
Description: Carnegie Mellon University's link grammar parser (all dictionaries) |
| 216 |
In Sleator, D. and Temperley, D. "Parsing English with a Link Grammar" |
| 217 |
(1991), the authors defined a new formal grammatical system called a |
| 218 |
"link grammar". A sequence of words is in the language of a link |
| 219 |
grammar if there is a way to draw "links" between words in such a way |
| 220 |
that the local requirements of each word are satisfied, the links do |
| 221 |
not cross, and the words form a connected graph. The authors encoded |
| 222 |
English grammar into such a system, and wrote this program to parse |
| 223 |
English using this grammar. |
| 224 |
. |
| 225 |
link-grammar can be used for linguistic parsing for information |
| 226 |
retrieval or extraction from natural language documents. It can also be |
| 227 |
used as a grammar checker. |
| 228 |
. |
| 229 |
This package contains all dictionaries bundled with link-grammar. |