Proceedings of TextGraphs: The First Workshop on Graph Based Methods for Natural Language Processing on the First Workshop on G 2006
DOI: 10.3115/1654758.1654775
|View full text |Cite
|
Sign up to set email alerts
|

Matching syntactic-semantic graphs for semantic relation assignment

Abstract: 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 consis… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2007
2007
2016
2016

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 15 publications
0
5
0
Order By: Relevance
“…The Graph-theoretical objects can be treated as a natural way of modeling one's impressions of a text. As the graphical objects are able to preserve the connections or relationship between its constituents of varying granularity [15]. With the help of the two fundamental components of graph structures namely vertices and edges, we can represent a text, hardly losing any information.…”
Section: Graph-based Modeling For Natural Language Textsmentioning
confidence: 99%
See 1 more Smart Citation
“…The Graph-theoretical objects can be treated as a natural way of modeling one's impressions of a text. As the graphical objects are able to preserve the connections or relationship between its constituents of varying granularity [15]. With the help of the two fundamental components of graph structures namely vertices and edges, we can represent a text, hardly losing any information.…”
Section: Graph-based Modeling For Natural Language Textsmentioning
confidence: 99%
“…These approaches represent the text by means of a graph, in which words or other text entities with meaningful relations are interconnected through vertices and edges. The information provided by the word order in a text is enough to construct a connected directed graph [15].…”
Section: Graph-based Modeling For Natural Language Textsmentioning
confidence: 99%
“…When trying to generate automatically favourable learning paths that match with the learner's needs the guidance should have a suitable balance between constraints for sustainability and freedom of association. Nastase and Szpakowicz (2006) introduced an incremental learning algorithm that effectively mimics the way in which a human reader accumulates knowledge and exploits it to process new text. The algorithm assigns a semantic relation to semantic units of text taken from a science book with guidance from a user and builds a simple syntactic-semantic graph surrounding the central concept and matching it with previously analysed text.…”
Section: Accumulating Knowledgementioning
confidence: 99%
“…This need has ledto natural language processing and understanding. Numbers of terms are required to represent the capabilities of the method, they are as follow: Event resolution, redundancy reduction, labeling, knowledge base, word sense disambiguation, word sense induction semantic [8] relatedness and similarity measures [10].These term if achieve in its best in method for natural language processing we can get best and fast access to the information. The main goal of this paper is to represent the survey on the capabilities of the various graph based method [9] for natural language processing and natural language understanding.…”
Section: Introductionmentioning
confidence: 99%