link-grammar 5.12.4~dfsg-2 source package in Ubuntu
Changelog
link-grammar (5.12.4~dfsg-2) unstable; urgency=high * Team upload * Source-only upload -- Jeremy BĂcha <email address hidden> Sun, 05 May 2024 13:29:51 -0400
Upload details
- Uploaded by:
- Jonas Smedegaard
- Uploaded to:
- Sid
- Original maintainer:
- Jonas Smedegaard
- Architectures:
- any all
- Section:
- text
- Urgency:
- Very Urgent
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Oracular | release | universe | text |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
link-grammar_5.12.4~dfsg-2.dsc | 2.9 KiB | 4b8f5257ee28d5cd399004e7ad3c6c817042bcbc7502db0ec8cc4cc48b458a38 |
link-grammar_5.12.4~dfsg.orig.tar.xz | 3.4 MiB | 4b39ad544be4f8525a41e24e4249db42791ffd446628b8d684257d242ecc32cc |
link-grammar_5.12.4~dfsg-2.debian.tar.xz | 30.7 KiB | 63fea868a3ff3fe513003a157558ef080ff104a7eada6b6f7276799a32427c1b |
Available diffs
No changes file available.
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-grammar5t64: 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-grammar5t64-dbgsym: debug symbols for liblink-grammar5t64
- 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