HFST-LOOKUP(1)

πŸ“¦
version 3.17.1 Β· 2 versions
  • 3.17.1 Β· debian bookworm, debian trixie, nixos 26.05, opensuse-leap 16.0, ubuntu jammy, ubuntu noble, ubuntu questing, ubuntu resolute, ubuntu stonking (latest)
  • 3.17.3 Β· nixpkgs unstable
, in debian bookworm, debian trixie, nixos 26.05, opensuse-leap 16.0, ubuntu jammy, ubuntu noble, ubuntu questing, ubuntu resolute, ubuntu stonking

✨ hfst-lookup β€” perform transducer lookup (apply) πŸ’…

okay bestie, welcome to hfst-lookup(1), a User Commands moment, and she's iconic. buckle up πŸŽ€


🌈 SYNOPSIS

hfst-lookup [OPTIONS...] [INFILE]

πŸ’– DESCRIPTION

perform transducer lookup (apply)

⚠️ NOTE: hfst-lookup does lookup from left to right as opposed to xfst and foma lookup which is carried out from right to left. In order to do lookup in a similar way as xfst and foma, use hfst-flookup instead. no cap, this is the plot twist of the whole page 😭

✨ OPTIONS ✨

🫢 Common options:

  • -h, --help β€” Print help message
  • -V, --version β€” Print version info
  • -v, --verbose β€” Print verbosely while processing
  • -q, --quiet β€” Only print fatal erros and requested output
  • -s, --silent β€” Alias of --quiet

πŸŽ€ Input/Output options:

  • -i, --input=INFILE β€” Read input transducer from INFILE
  • -o, --output=OUTFILE β€” Write output to OUTFILE
  • -p, --pipe-mode[=STREAM] β€” Control input and output streams

πŸ¦‹ Lookup options:

  • -I, --input-strings=SFILE β€” Read lookup strings from SFILE
  • -O, --output-format=OFORMAT β€” Use OFORMAT printing results sets
  • -e, --epsilon-format=EPS β€” Print epsilon as EPS
  • -F, --input-format=IFORMAT β€” Use IFORMAT parsing input
  • -x, --statistics β€” Print statistics
  • -X, --xfst=VARIABLE β€” Toggle xfst VARIABLE
  • -c, --cycles=INT β€” How many times to follow input epsilon cycles (only for non-lookup-optimized transducers)
  • -n, --max-number=INT β€” Maximum number of results printed for each input (only for lookup-optimized transducers)
  • -b, --beam=B β€” Output only analyses whose weight is within B from the best analysis
  • -t, --time-cutoff=S β€” Limit search after having used S seconds per input (only for lookup-optimized transducers)
  • -C, --cascade=CASCADE β€” How multiple transducers in input are handled
  • -P, --progress β€” Show neat progress bar if possible

If OUTFILE or INFILE is missing or -, standard streams will be used. Format of result depends on format of INFILE. OFORMAT is one of {xerox,cg,apertium}, xerox being default. IFORMAT is one of {text,spaced,apertium}, default being text, unless OFORMAT is apertium. VARIABLEs relevant to lookup are {print-pairs,print-space,quote-special,show-flags,obey-flags}. Input epsilon cycles are followed by default INT=5 times. Epsilon is printed by default as an empty string. B must be a non-negative float. S must be a non-negative float. The default, 0.0, indicates no cutoff. If the input contains several transducers, a set containing results from all transducers is printed for each input string.

CASCADE must be one of { union, priority-union, composition }. If not specified, defaults to {union}.

STREAM can be { input, output, both }. If not given, defaults to {both}. If input file is not specified with -I, input is read interactively line by line from the user. If you redirect input from a file, use --pipe-mode=input. --pipe-mode=output is ignored on non-windows platforms.


πŸ™ˆ Todo:

Support --xfst=obey-flags for optimized lookup format. Support --cycles for optimized lookup format.

πŸ’€ Known bugs:

'quote-special' quotes spaces that come from 'print-space'


πŸ› REPORTING BUGS

Report bugs to <hfst-bugs@helsinki.fi> or directly to our bug tracker at: <https://github.com/hfst/hfst/issues>


Copyright Β© 2017 University of Helsinki, License GPLv3: GNU GPL version 3 <http://gnu.org/licenses/gpl.html>

This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law. periodt πŸ’…


okay that's the whole page bestie, you ate that 🫢 this was the HFST release from August 2018, mwah πŸ’–

πŸ“¦ where this page comes from