Handbook of graph grammars and computing by graph transformation
Accurate unlexicalized parsing
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Movie review mining and summarization
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
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
The Stanford typed dependencies representation
CrossParser '08 Coling 2008: Proceedings of the workshop on Cross-Framework and Cross-Domain Parser Evaluation
Open information extraction from the web
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A semantic approach to textual entailment: system evaluation and task analysis
RTE '07 Proceedings of the ACL-PASCAL Workshop on Textual Entailment and Paraphrasing
Precision-focused textual inference
RTE '07 Proceedings of the ACL-PASCAL Workshop on Textual Entailment and Paraphrasing
Entailment and anaphora resolution in RTE3
RTE '07 Proceedings of the ACL-PASCAL Workshop on Textual Entailment and Paraphrasing
Introduction to the CoNLL-2005 shared task: semantic role labeling
CONLL '05 Proceedings of the Ninth Conference on Computational Natural Language Learning
Sentence level sentiment analysis in the presence of conjuncts using linguistic analysis
ECIR'07 Proceedings of the 29th European conference on IR research
Non compositional semantics using rewriting
LTC'09 Proceedings of the 4th conference on Human language technology: challenges for computer science and linguistics
Modular graph rewriting to compute semantics
IWCS '11 Proceedings of the Ninth International Conference on Computational Semantics
A survey and comparison of transformation tools based on the transformation tool contest
Science of Computer Programming
| Hi-index | 0.00 |
We present a normalisation framework for linguistic representations and illustrate its use by normalising the Stanford Dependency graphs (SDs) produced by the Stanford parser into Labelled Stanford Dependency graphs (LSDs). The normalised representations are evaluated both on a testsuite of constructed examples and on free text. The resulting representations improve on standard Predicate/Argument structures produced by SRL by combining role labelling with the semantically oriented features of SDs. Furthermore, the proposed normalisation framework opens the way to stronger normalisation processes which should be useful in reducing the burden on inference.