Paper: Applying And Improving The Restriction Grammar Approach For Dutch Patient Discharge Summaries

ACL ID C92-4204
Title Applying And Improving The Restriction Grammar Approach For Dutch Patient Discharge Summaries
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1992
Authors
  • Peter Spyns (Catholic University of Leuven, Leuven Belgium; University Hospital Gasthuisberg, Leuven Belgium)
  • Geert Adriaens (Siemens-Nixdorf Software Liege, Liege Belgium; Catholic University of Leuven, Leuven Belgium)

The abstraction function can be defined as follows: F: Node -> [TreeTerm,Path] : TreeTerm = tt(Label,Child,Sibling,Word), Word = [Item,lnfo]. The representation invariant is: VkE {Nodes} : Item is a Dutch word or punctuation sign, Info is one of the grammatical categories, Item = [] <=> Label = *nulln, Word is instantiated <=> Label = (literal v terminal), Label is always ground. The first relation of the abstraction function states that a TreeTerm contains linguistic (Label,ltem) as well as positional information (Child,Sibling). The second relation links a node to the path in the parse tree that must be traversed to reach the root starting from that node. Movements in the parse tree are executed by means of the up/2, down/2, right/2 and left/2 operators. As subtrees are successfully gene...