Automatic labeling of semantic roles
Computational Linguistics
Pattern Matching for Case Analysis: A Computational Definition of Closeness
ICCI '93 Proceedings of the Fifth International Conference on Computing and Information
Class-Based Construction of a Verb Lexicon
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Test-Driving TANKA: Evaluating a Semi-automatic System of Text Analysis for Knowledge Acquisition
AI '98 Proceedings of the 12th Biennial Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
Systematic construction of a versatile case system
Natural Language Engineering
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
The descent of hierarchy, and selection in relational semantics
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Semantic role labeling using different syntactic views
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Semantic interpretation of nominalizations
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Building concept representations from reusable components
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Putting pieces together: combining FrameNet, VerbNet and WordNet for robust semantic parsing
CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
GrAF: a graph-based format for linguistic annotations
LAW '07 Proceedings of the Linguistic Annotation Workshop
SemEval-2010 task 9: The interpretation of noun compounds using paraphrasing verbs and prepositions
SemEval '10 Proceedings of the 5th International Workshop on Semantic Evaluation
Natural Language Compression on Edge-Guided text preprocessing
Information Sciences: an International Journal
| Hi-index | 0.00 |
We present a graph-matching algorithm for semantic relation assignment. The algorithm is part of an interactive text analysis system. The system automatically extracts pairs of syntactic units from a text and assigns a semantic relation to each pair. This is an incremental learning algorithm, in which previously processed pairs and user feedback guide the process. After each assignment, the system adds to its database a syntactic-semantic graph centered on the main element of each pair of units. A graph consists of the main unit and all syntactic units with which it is syntactically connected. An edge contains information both about syntax and about semantic relations for use in further processing. Syntactic-semantic graph matching is used to produce a list of candidate assignments for 63.75% of the pairs analysed, and in 57% of situations the correct relations is one of the system's suggestions; in 19.6% of situations it suggests only the correct relation.