2016 2nd International Conference on Advances in Computing, Communication, &Amp; Automation (ICACCA) (Fall) 2016
DOI: 10.1109/icaccaf.2016.7748995
|View full text |Cite
|
Sign up to set email alerts
|

Malayalam text summarization: Minimum spanning tree based graph reduction approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 1 publication
0
1
0
Order By: Relevance
“…A graph-based method for Malayalam documents has been proposed in [11] where the sentences are represented as nodes and vertex weight is calculated using similarity measures. Minimum spanning tree Malayalam summarizer [12] creates a semantic graph from the input document and thereby graph reduction is performed using minimum spanning tree concept by creating repetitive subgraphs.…”
Section: Related Workmentioning
confidence: 99%
“…A graph-based method for Malayalam documents has been proposed in [11] where the sentences are represented as nodes and vertex weight is calculated using similarity measures. Minimum spanning tree Malayalam summarizer [12] creates a semantic graph from the input document and thereby graph reduction is performed using minimum spanning tree concept by creating repetitive subgraphs.…”
Section: Related Workmentioning
confidence: 99%