The language chosen for semantic representation is a flat semantics along the line of ( Bos , 1995 ; Copestake et al. , 1999 ; Copestake et al. , 2001 ) .
predicate logic unplugged
J Bos
In contrast , the bottom feature structure encodes information that remains local to the node at which adjunction takes place . The language chosen for semantic representation is a flat semantics along the line of ( Bos , 1995 ; Copestake et al. , 1999 ; Copestake et al. , 2001 ) . However because we are here focusing on paraphrases rather than fine grained semantic distinctions , the underspecification and the description of the scope relations permitted by these semantics will here be largely ignored and flat semantics will be principally used as a convenient way of describing predicate/arguments and modifiers/modified relationships .
The language chosen for semantic representation is a flat semantics along the line of ( @@CITATION ; Copestake et al. , 1999 ; Copestake et al. , 2001 ) .