/usr/share/link-grammar/ru/4.0.knowledge is in link-grammar-dictionaries-all 5.3.16-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 | ; Post-processing knowledge file
; 6/96
; ----------------------------------------------------------------------------
; This file contains the knowledge related to post-processing, in the
; form of lists and rules. This file is read by post-process.c at run-time.
; Syntax of file:
; line starting with ";" is a comment
; commas are field delimiters
; any token beginning with the character @ is expanded to the set
; of symbols it defined. e.g. one could write
; FOO: blah1 blah2 blah3
; thus defining a set FOO containing three strings. Then one could later write
; BAR: blah5 @FOO blah8
; which defines a set BAR containing 5 strings.
;
; Capitalized tokens are *required*, though if you feel like providing an
; empty list afterwards, that's your right.
; ----------------------------------------------------------------------------
; the following links start a domain. Each must be given a name in the
; table below (STARTING_LINK_TYPE_TABLE)
DOMAIN_STARTER_LINKS:
W
URFL_DOMAIN_STARTER_LINKS:
URFL_ONLY_DOMAIN_STARTER_LINKS:
DOMAIN_CONTAINS_LINKS:
MUST_FORM_A_CYCLE_LINKS:
RESTRICTED_LINKS:
LEFT_DOMAIN_STARTER_LINKS:
IGNORE_THESE_LINKS:
; ----------------------------------------------------------------------
; ---------------------- LINK TYPE TABLE-------------------------------
; ----------------------------------------------------------------------
; the following table associates a domain type with each possible
; starting link. It contains pairs: the first of each pair is a link
; type, and the second is the domain to which that link type belongs.
STARTING_LINK_TYPE_TABLE:
W m
CONTAINS_ONE_RULES:
CONTAINS_NONE_RULES:
FORM_A_CYCLE_RULES:
|