A simple but useful approach to conjunct identification

Authors:
Rajeev Agarwal;Lois Boggess
Affiliations:
Mississippi State University, Mississippi State, MS;Mississippi State University, Mississippi State, MS
Venue:
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Year:
1992

Citing 1
Cited 20

The Automated Building and Updating of a Knowledge Base Through the Analysis of Natural Language Text

The Automated Building and Updating of a Knowledge Base Through the Analysis of Natural Language Text

A syntactic analysis method of long Japanese sentences based on the detection of conjunctive structures

Computational Linguistics
Generation and Evaluation of Indexes for Chemistry Articles

Journal of Intelligent Information Systems
Retrieving NASA problem reports: a case study in natural language information retrieval

Data & Knowledge Engineering - NLDB2002
Extracting molecular binding relationships from biomedical text

ANLC '00 Proceedings of the sixth conference on Applied natural language processing
Disambiguation of proper names in text

ANLC '97 Proceedings of the fifth conference on Applied natural language processing
An automated system that assists in the generation of document indexes

Natural Language Engineering
Informed parsing for coordination with combinatory categorial grammar

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
(Almost) automatic semantic feature extraction from technical text

HLT '94 Proceedings of the workshop on Human Language Technology
Dependency parsing of Japanese spoken monologue based on clause boundaries

ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Using the web as an implicit training set: application to structural ambiguity resolution

HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Are morpho-syntactic features more predictive for the resolution of noun phrase coordination ambiguity than lexico-semantic similarity scores?

COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
Coordination disambiguation without any similarities

COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
Parsing coordinations

EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Towards identifying intervention arms in randomized controlled trials: Extracting coordinating constructions

Journal of Biomedical Informatics
Anaphors, PPs and disambiguation process for conceptual analysis

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Coordinate structure analysis with global structural constraints and alignment-based local features

ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2
Automatic detection of nocuous coordination ambiguities in natural language requirements

Proceedings of the IEEE/ACM international conference on Automated software engineering
Syntactic analysis of long sentences based on s-clauses

IJCNLP'04 Proceedings of the First international joint conference on Natural Language Processing
The design of SREE: a prototype potential ambiguity finder for requirements specifications and lessons learned

REFSQ'13 Proceedings of the 19th international conference on Requirements Engineering: Foundation for Software Quality
Identifying non-elliptical entity mentions in a coordinated NP with ellipses

Journal of Biomedical Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an approach to identifying conjuncts of coordinate conjunctions appearing in text which has been labelled with syntactic and semantic tags. The overall project of which this research is a part is also briefly discussed. The program was tested on a 10,000 word chapter of the Merck Veterinary Manual. The algorithm is deterministic and domain independent and it performs relatively well on a large real-life domain. Constructs not handled by the simple algorithm are also described in some detail.