link-grammar 5.12.3~dfsg-1build3 source package in Ubuntu
Changelog
link-grammar (5.12.3~dfsg-1build3) noble; urgency=medium * No-change rebuild for CVE-2024-3094 -- Steve Langasek <email address hidden> Sun, 31 Mar 2024 19:57:11 +0000
Upload details
- Uploaded by:
- Steve Langasek
- Uploaded to:
- Noble
- Original maintainer:
- Ubuntu Developers
- Architectures:
- any all
- Section:
- text
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Noble | release | universe | text |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| link-grammar_5.12.3~dfsg.orig.tar.xz | 3.4 MiB | cda8c0aa84622d1c46d0c5ae3b629d6c06657c1e3abd7e0c5d58eb8d0c1eed06 |
| link-grammar_5.12.3~dfsg-1build3.debian.tar.xz | 30.0 KiB | b294d42839dd2d88f4cfde8e32c3f78fb3170b603d4e9c85ca1b955711a7ccb2 |
| link-grammar_5.12.3~dfsg-1build3.dsc | 3.1 KiB | b2b2bd4df38212ce8f4380d47768c58e2921f2a1c070c141b146db9f49282cfd |
Available diffs
Binary packages built by this source
- liblink-grammar-dev: 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
- liblink-grammar-java: 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.
- liblink-grammar-java-dbgsym: debug symbols for liblink-grammar-java
- liblink-grammar5: 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.
- liblink-grammar5-dbgsym: debug symbols for liblink-grammar5
- link-grammar: 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.
- link-grammar-dbgsym: debug symbols for link-grammar
- link-grammar-dictionaries-all: 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.
- link-grammar-dictionaries-en: 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.
- python-link-grammar-examples: 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.
- python3-link-grammar: 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.
- python3-link-grammar-dbgsym: debug symbols for python3-link-grammar
