The logic of typed feature structures
The logic of typed feature structures
Structural matching of parallel texts
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
A unification-based parser for relational grammar
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Chart-based transfer rule application in Machine Translation
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Alignment of shared forests for bilingual corpora
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
The Penn Treebank: annotating predicate argument structure
HLT '94 Proceedings of the workshop on Human Language Technology
Extracting relations with integrated information using kernel methods
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Discriminative slot detection using kernel methods
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Preemptive information extraction using unrestricted relation discovery
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
The CoNLL-2008 shared task on joint parsing of syntactic and semantic dependencies
CoNLL '08 Proceedings of the Twelfth Conference on Computational Natural Language Learning
Who, what, when, where, why?: comparing multiple approaches to the cross-lingual 5W task
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 1 - Volume 1
Unsupervised discovery of relations for analysis of textual data
Digital Investigation: The International Journal of Digital Forensics & Incident Response
Hi-index | 0.00 |
This paper introduces GLARF, a framework for predicate argument structure. We report on converting the Penn Treebank II into GLARF by automatic methods that achieved about 90% precision/recall on test sentences from the Penn Treebank. Plans for a corpus of hand-corrected output, extensions of GLARF to Japanese and applications for MT are also discussed.