In this paper we argue for a reconceptualization of the Tree Adjoining Grammar (TAG) formalism, i... more In this paper we argue for a reconceptualization of the Tree Adjoining Grammar (TAG) formalism, in which the elementary structures are collections of c-command relations, and the combinatory operation is substitution. We show how the formalism we sketch resolves a number of problems for TAG that have been identified in the literature. Additionally, we demonstrate that our proposal is preferable to other previously proposed extensions to TAG, for example D-tree grammars , in that it preserves many of the linguistically desirable aspects of TAG's restrictiveness, specifically concerning the derivation of locality constraints on unbounded dependencies.
In this paper we argue for a reconceptualization of the Tree Adjoining Grammar (TAG) formalism, i... more In this paper we argue for a reconceptualization of the Tree Adjoining Grammar (TAG) formalism, in which the elementary structures are collections of c-command relations, and the combinatory operation is substitution. We show how the formalism we sketch resolves a number of problems for TAG that have been identified in the literature. Additionally, we demonstrate that our proposal is preferable to other previously proposed extensions to TAG, for example D-tree grammars , in that it preserves many of the linguistically desirable aspects of TAG's restrictiveness, specifically concerning the derivation of locality constraints on unbounded dependencies.
The PropBank project is creating a corpus of text annotated with information about basic semantic... more The PropBank project is creating a corpus of text annotated with information about basic semantic propositions. PropBank I (Kingsbury & Palmer, 2002) added a layer of predicateargument information, or semantic roles, to the syntactic structures of the English Penn Treebank. This paper presents an overview of the second phase of PropBank Annotation, PropBank II, which is being applied to English and Chinese, and includes (Neodavidsonian) eventuality variables, nominal references, sense tagging, and connections to the Penn Discourse Treebank (PDTB), a project for annotating discourse connectives and their arguments.
Recent work in machine translation and information extraction has demonstrated the utility of a l... more Recent work in machine translation and information extraction has demonstrated the utility of a level that represents the predicate-argument structure. It would be especially useful for machine translation to have two such Proposition Banks, one for each language under consideration. A Proposition Bank for English has been developed over the last few years, and we describe here our development of a tool for facilitating the development of a Chinese Proposition Bank. We also discuss some issues specific to the Chinese Treebank that complicate the matter of mapping syntactic representation to a predicate-argument level, and report on some preliminary evaluation of the accuracy of the semantic tagging tool.
Abstract The PropBank primarily adds semantic role labels to the syntactic constituents in the pa... more Abstract The PropBank primarily adds semantic role labels to the syntactic constituents in the parsed trees of the ,Treebank. The goal is for automatic semantic role labeling to be able to use the domain,of locality of a ,predicate in order ,to find ,its arguments. In principle, this is exactly what iswanted, but in practice the PropBank annotators often make,choices that
Arabic diacritization (referred to sometimes as vocalization or vowelling), defined as the full o... more Arabic diacritization (referred to sometimes as vocalization or vowelling), defined as the full or partial representation of short vowels, shadda (consonantal length or germination), tanween (nunation or definiteness), and hamza (the glottal stop and its support letters), is still largely understudied in the current NLP literature. In this paper, the lack of diacritics in standard Arabic texts is presented as a major challenge to most Arabic natural language processing tasks, including parsing. Recent studies (Messaoudi, et al. 2004; Vergyri & Kirchhoff 2004; Zitouni, et al. 2006 and Maamouri, et al. forthcoming) about the place and impact of diacritization in text-based NLP research are presented along with an analysis of the weight of the missing diacritics on Treebank morphological and syntactic analyses and the impact on parser development.
The Arabic Treebank at the Linguistic Data Consortium has significantly revised and enhanced its ... more The Arabic Treebank at the Linguistic Data Consortium has significantly revised and enhanced its annotation guidelines and annotation procedure over the past year. The revised syntactic guidelines are now being applied in annotation production, and the combination of the revised guidelines and a period of intensive annotator training has raised inter-annotator agreement f-measure scores already. Revised morphological/part-of-speech (POS) guidelines are nearly complete as well, and will be applied in annotation production in the near future. This paper reports on an experiment in automatically enhancing the old morphological/POS tags in the right direction and the resulting parsing improvement. Finally, a new division of the POS analysis marking both morphological form and POS function is proposed.
We describe a parallel annotation approach for PubMed abstracts. It includes both entity/relation... more We describe a parallel annotation approach for PubMed abstracts. It includes both entity/relation annotation and a treebank containing syntactic structure, with a goal of mapping entities to constituents in the treebank. Crucial to this approach is a modification of the Penn Treebank guidelines and the characterization of entities as relation components, which allows the integration of the entity annotation with the syntactic structure while retaining the capacity to annotate and extract more complex events.
The Arabic Treebank team at the Linguistic Data Consortium has significantly revised and enhanced... more The Arabic Treebank team at the Linguistic Data Consortium has significantly revised and enhanced its annotation guidelines and procedure over the past year. Improvements were made to both the morphological and syntactic annotation guidelines, and annotators were trained in the new guidelines, focusing on areas of low inter-annotator agreement. The revised guidelines are now being applied in annotation production, and the combination of the revised guidelines and a period of intensive annotator training has raised inter-annotator agreement f-measure scores already and has also improved parsing results.
A complex relation is any n-ary relation in which some of the arguments may be be unspecified. We... more A complex relation is any n-ary relation in which some of the arguments may be be unspecified. We present here a simple two-stage method for extracting complex relations between named entities in text. The first stage creates a graph from pairs of entities that are likely to be related, and the second stage scores maximal cliques in that graph as potential complex relation instances. We evaluate the new method against a standard baseline for extracting genomic variation relations from biomedical text.
In this paper we argue for a reconceptualization of the Tree Adjoining Grammar (TAG) formalism, i... more In this paper we argue for a reconceptualization of the Tree Adjoining Grammar (TAG) formalism, in which the elementary structures are collections of c-command relations, and the combinatory operation is substitution. We show how the formalism we sketch resolves a number of problems for TAG that have been identified in the literature. Additionally, we demonstrate that our proposal is preferable to other previously proposed extensions to TAG, for example D-tree grammars , in that it preserves many of the linguistically desirable aspects of TAG's restrictiveness, specifically concerning the derivation of locality constraints on unbounded dependencies.
In this paper we argue for a reconceptualization of the Tree Adjoining Grammar (TAG) formalism, i... more In this paper we argue for a reconceptualization of the Tree Adjoining Grammar (TAG) formalism, in which the elementary structures are collections of c-command relations, and the combinatory operation is substitution. We show how the formalism we sketch resolves a number of problems for TAG that have been identified in the literature. Additionally, we demonstrate that our proposal is preferable to other previously proposed extensions to TAG, for example D-tree grammars , in that it preserves many of the linguistically desirable aspects of TAG's restrictiveness, specifically concerning the derivation of locality constraints on unbounded dependencies.
The PropBank project is creating a corpus of text annotated with information about basic semantic... more The PropBank project is creating a corpus of text annotated with information about basic semantic propositions. PropBank I (Kingsbury & Palmer, 2002) added a layer of predicateargument information, or semantic roles, to the syntactic structures of the English Penn Treebank. This paper presents an overview of the second phase of PropBank Annotation, PropBank II, which is being applied to English and Chinese, and includes (Neodavidsonian) eventuality variables, nominal references, sense tagging, and connections to the Penn Discourse Treebank (PDTB), a project for annotating discourse connectives and their arguments.
Recent work in machine translation and information extraction has demonstrated the utility of a l... more Recent work in machine translation and information extraction has demonstrated the utility of a level that represents the predicate-argument structure. It would be especially useful for machine translation to have two such Proposition Banks, one for each language under consideration. A Proposition Bank for English has been developed over the last few years, and we describe here our development of a tool for facilitating the development of a Chinese Proposition Bank. We also discuss some issues specific to the Chinese Treebank that complicate the matter of mapping syntactic representation to a predicate-argument level, and report on some preliminary evaluation of the accuracy of the semantic tagging tool.
Abstract The PropBank primarily adds semantic role labels to the syntactic constituents in the pa... more Abstract The PropBank primarily adds semantic role labels to the syntactic constituents in the parsed trees of the ,Treebank. The goal is for automatic semantic role labeling to be able to use the domain,of locality of a ,predicate in order ,to find ,its arguments. In principle, this is exactly what iswanted, but in practice the PropBank annotators often make,choices that
Arabic diacritization (referred to sometimes as vocalization or vowelling), defined as the full o... more Arabic diacritization (referred to sometimes as vocalization or vowelling), defined as the full or partial representation of short vowels, shadda (consonantal length or germination), tanween (nunation or definiteness), and hamza (the glottal stop and its support letters), is still largely understudied in the current NLP literature. In this paper, the lack of diacritics in standard Arabic texts is presented as a major challenge to most Arabic natural language processing tasks, including parsing. Recent studies (Messaoudi, et al. 2004; Vergyri & Kirchhoff 2004; Zitouni, et al. 2006 and Maamouri, et al. forthcoming) about the place and impact of diacritization in text-based NLP research are presented along with an analysis of the weight of the missing diacritics on Treebank morphological and syntactic analyses and the impact on parser development.
The Arabic Treebank at the Linguistic Data Consortium has significantly revised and enhanced its ... more The Arabic Treebank at the Linguistic Data Consortium has significantly revised and enhanced its annotation guidelines and annotation procedure over the past year. The revised syntactic guidelines are now being applied in annotation production, and the combination of the revised guidelines and a period of intensive annotator training has raised inter-annotator agreement f-measure scores already. Revised morphological/part-of-speech (POS) guidelines are nearly complete as well, and will be applied in annotation production in the near future. This paper reports on an experiment in automatically enhancing the old morphological/POS tags in the right direction and the resulting parsing improvement. Finally, a new division of the POS analysis marking both morphological form and POS function is proposed.
We describe a parallel annotation approach for PubMed abstracts. It includes both entity/relation... more We describe a parallel annotation approach for PubMed abstracts. It includes both entity/relation annotation and a treebank containing syntactic structure, with a goal of mapping entities to constituents in the treebank. Crucial to this approach is a modification of the Penn Treebank guidelines and the characterization of entities as relation components, which allows the integration of the entity annotation with the syntactic structure while retaining the capacity to annotate and extract more complex events.
The Arabic Treebank team at the Linguistic Data Consortium has significantly revised and enhanced... more The Arabic Treebank team at the Linguistic Data Consortium has significantly revised and enhanced its annotation guidelines and procedure over the past year. Improvements were made to both the morphological and syntactic annotation guidelines, and annotators were trained in the new guidelines, focusing on areas of low inter-annotator agreement. The revised guidelines are now being applied in annotation production, and the combination of the revised guidelines and a period of intensive annotator training has raised inter-annotator agreement f-measure scores already and has also improved parsing results.
A complex relation is any n-ary relation in which some of the arguments may be be unspecified. We... more A complex relation is any n-ary relation in which some of the arguments may be be unspecified. We present here a simple two-stage method for extracting complex relations between named entities in text. The first stage creates a graph from pairs of entities that are likely to be related, and the second stage scores maximal cliques in that graph as potential complex relation instances. We evaluate the new method against a standard baseline for extracting genomic variation relations from biomedical text.
Uploads
Papers by lu lu