nixpkgs/pkgs/development/libraries/languagemachines/timblserver.nix
Silvan Mosberger 4f0dadbf38 treewide: format all inactive Nix files
After final improvements to the official formatter implementation,
this commit now performs the first treewide reformat of Nix files using it.
This is part of the implementation of RFC 166.

Only "inactive" files are reformatted, meaning only files that
aren't being touched by any PR with activity in the past 2 months.
This is to avoid conflicts for PRs that might soon be merged.
Later we can do a full treewide reformat to get the rest,
which should not cause as many conflicts.

A CI check has already been running for some time to ensure that new and
already-formatted files are formatted, so the files being reformatted here
should also stay formatted.

This commit was automatically created and can be verified using

    nix-build a08b3a4d19.tar.gz \
      --argstr baseRev b32a094368
    result/bin/apply-formatting $NIXPKGS_PATH
2024-12-10 20:26:33 +01:00

58 lines
1.9 KiB
Nix

{
lib,
stdenv,
fetchurl,
automake,
autoconf,
bzip2,
libtar,
libtool,
pkg-config,
autoconf-archive,
libxml2,
languageMachines,
}:
let
release = lib.importJSON ./release-info/LanguageMachines-timblserver.json;
in
stdenv.mkDerivation {
pname = "timblserver";
version = release.version;
src = fetchurl {
inherit (release) url sha256;
name = "timblserver-${release.version}.tar.gz";
};
nativeBuildInputs = [
pkg-config
automake
autoconf
];
buildInputs = [
bzip2
libtar
libtool
autoconf-archive
libxml2
languageMachines.ticcutils
languageMachines.timbl
];
preConfigure = "sh bootstrap.sh";
meta = with lib; {
description = "This server for TiMBL implements several memory-based learning algorithms";
homepage = "https://github.com/LanguageMachines/timblserver/";
license = licenses.gpl3;
platforms = platforms.all;
maintainers = with maintainers; [ roberth ];
longDescription = ''
This implements a server for TiMBL. TiMBL is an open source software package implementing several memory-based learning algorithms, among which IB1-IG, an implementation of k-nearest neighbor classification with feature weighting suitable for symbolic feature spaces, and IGTree, a decision-tree approximation of IB1-IG. All implemented algorithms have in common that they store some representation of the training set explicitly in memory. During testing, new cases are classified by extrapolation from the most similar stored cases.
For over fifteen years TiMBL has been mostly used in natural language processing as a machine learning classifier component, but its use extends to virtually any supervised machine learning domain. Due to its particular decision-tree-based implementation, TiMBL is in many cases far more efficient in classification than a standard k-nearest neighbor algorithm would be.
'';
};
}