;;; -*- Mode: TDL-*- 

;;; Authors: 
;;; Bart Cramer


;; definition of names of types with a special meaning to PET
special-name-top := "*top*".
special-name-symbol := "string".
special-name-string := "string".
special-name-cons := "ne-list".
special-name-list := "list".
special-name-nil := "null".
special-name-difflist := "diff-list".

special-name-attr-first := "FIRST".
special-name-attr-rest := "REST".
special-name-attr-list := "LIST".
special-name-attr-last := "LAST".
special-name-attr-args := "ARGS".

;; status values that marks rules
rule-status-values := rule.
lexrule-status-values := lex-rule.

;; status values that marks lexicon entries
lexentry-status-values := lex-entry. 

;; path to the list of arguments in a rule
rule-args-path := ARGS.

;; path to marker for key argument of a rule
;keyarg-marker-path := KEY-ARG.

;; path to marker for head dtr of a rule
head-dtr-path := HD-DTR.

;; path to orthography
orth-path := STEM.

;; type to mark boolean value `true'
true-type := +.


;;
;; encoding used in grammar source files (should be `euc-jp' for Japanese).
;;
encoding := utf-8.

;;
;; input preprocessing: disable downcasing and (English-specific) explosion of
;; apostrophes.
;;
trivial-tokenizer.

;;
;; type of a valid parse, start symbol
;;
start-symbols := $root-sent $root-wh-question $root-inf-final $root-psp-final $root-np $root-pp $root-ds.

;;
;; word-breaking characters in tokenization --- treated as whitespace
;;
punctuation-characters := "".

;;
;; suppress results of regular morphology rules if irregular form exists
;;
irregular-forms-only.
lex-entries-can-fail.

;;
;; names of attributes not to pass from daughter to mother in parsing
;;
deleted-daughters := ARGS HD-DTR NH-DTR.

;;
;; names of attributes to filter for packing parser
;;
packing-restrictor := CONT.

;;
;; path into the MRS semantics
;;
mrs-path := "SYNSEM.LOCAL.CONT".

;;
;; path to LABEL for relation-to-word mapping, absolute and within a relation
;;
;label-path := "SYNSEM.LKEYS.--KEYREL.WLINK".
;label-path-tail := "WLINK".

;;
;; name of type containing quick check structure
;;
;qc-structure := $qc_paths.

;; 
;; the scoring model, either for on-line use in best-first parsing or off-line
;; ranking of complete parse results after parsing.
;;

;sm := "tiger-10.mem".


;;
;; as an alternative to the `KEY-ARG' mechanism in the actual rules, one can
;; stipulate the key daughter for each rule, e.g. (using names that will most
;; likely not be used in a grammar to avoid interference):
;;
#|
rule-keyargs := 
  $subj-head-example 2
  $head-complement-example 1.
|#

;;
;; some rules should be constrained to only apply over the entire string, i.e.
;; to edges that span the full input; this should improve parsing efficiency
;; only, rather than be considered part of the linguistic analyses.  e.g.
;;
#|
spanning-only-rules := 
  $runon-s-example.
|#

;;;
;;; generic lexical entries for unknown words: basically, for each unknown
;;; token in the input all generic entries are postulated.  optionally, there
;;; are two devices to filter out generic entries: suffix-based and by virtue
;;; of POS tag information.  generic entries that require a certain suffix
;;; (`generic-le-suffixes') only fire if the input form has the suffix.  if
;;; the input word has one more more POS tags associated to it, these are
;;; looked up in the `posmapping' table: this table is a list of pairs (tag,
;;; gle) where `gle' is the name of one of the generic items in `generic-les'.
;;; a non-empty `posmapping' table will filter all generic entries that are not
;;; explicitly licensed by a POS tag.
;;;
#|
generic-lexentry-status-values := generic-lex-entry.
|#
;;
;; some generic lexical entries require inflectional marking.  this mechanism
;; is a filter on which generic entries proposed by other means can survive:
;; generic entries listed here will only be postulated if the required suffix 
;; can be matched against the input token.
;;
;; when using only generic entries licensed by a POS tag, the suffix filter
;; really does not make a lot of sense anymore.               (6-jun-03; oe)
;;
#|
generic-le-suffixes := 
  $generic_trans_verb_pres3sg "S" 
  $generic_trans_verb_past "ED" 
  $generic_trans_verb_psp "ED" 
  $generic_trans_verb_prp "ING" 
  $generic_pl_noun "S"
.
|#

;;
;; a sample mapping of POS tags to generic lexical entries, borrowed from the
;; NEGRA treebank. 
;;

default-les := true.
yy := true.

posmapping :=
  VVFIN $generic-vvfin
  VVINF $generic-vvinf
  VVIZU $generic-vvizu
  VVPP  $generic-vvpp
  ADJA  $generic-adja
  ADJD  $generic-adv
  ADV   $generic-adv
  NN    $generic-noun
  NE    $generic-name
  CARD  $generic-number
.

;;
;; as of august 2003, PET includes ECL and the generic (R)MRS code; hence, we
;; need to include the MRS settings from the grammar.
;;
;postload-lisp-files := "lkb/mrsglobals.lisp".

:include "cm".