Paper: Assigning Function Tags To Parsed Text

ACL ID A00-2031
Title Assigning Function Tags To Parsed Text
Venue Annual Conference of the North American Chapter of the Association for Computational Linguistics
Session Main Conference
Year 2000
Authors

It is generally recognized that the common non- terminal labels for syntactic constituents (NP, VP, etc). do not exhaust the syntactic and se- mantic information one would like about parts of a syntactic tree. For example, the Penn Tree- bank gives each constituent zero or more 'func- tion tags' indicating semantic roles and other related information not easily encapsulated in the simple constituent labels. We present a sta- tistical algorithm for assigning these function tags that, on text already parsed to a simple- label level, achieves an F-measure of 87%, which rises to 99% when considering 'no tag' as a valid choice.