Skip to content

Latest commit

 

History

History
35 lines (31 loc) · 1.93 KB

LogicalVocabulary.md

File metadata and controls

35 lines (31 loc) · 1.93 KB

Vocabulary of predicates generated by UDepLambda

By the time the post processor gets its hands on a meaning form, the form may contain ten kinds of literals (as documented in deplambda.others.PredicateKeys; see also the patterns in PostProcessLogicalForm. For a description of the types see ud_types.txt.

We use the following types below:

  • tri is <v,<v,<v,t>>>
  • b is <v,<v,t>>
  • u is <v,t>
  • v is <a,e>

Below, arguments in {...} are specified at run-time. I also try to specify information about some of the meta-variables in the predicate description gleaned from examining the current (ud-) rules in lib_data. (Note: the earlier deplambda- rules in the same directory have a different syntax and correspond to an older version of the system.)

  • p_EVENT.ENTITY_<Relation>:b. In the current set of rules, <Relation> is one of l-nmod.{casemarker} or l-nmod arg1.{casemarker} or arg0, arg1, arg2.v
  • p_EVENT.EVENT_{relation}:b
  • p_COUNT:b
  • p_TARGET:u
  • p_EVENT_{word}:u. {word} is typically of the form w-<Index>-<Word>, where <Index> is the integer index into the utterance, and <Word> is the corresponding word.
  • p_TYPE_{word}:u
  • p_TYPEMOD_{word}:u
  • p_EVENTMOD_{word}:u
  • p_CONJ:tri
  • p_EQUAL (Note: This exists in PredicateKeys but there are no instances of this in the ud- rules.)

Actually, the rules also produce