Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Text summarization using latent semantic analysis
Download
index.pdf
Date
2011
Author
Özsoy, Makbule Gülçin
Metadata
Show full item record
Item Usage Stats
319
views
628
downloads
Cite This
Text summarization solves the problem of presenting the information needed by a user in a compact form. There are different approaches to create well formed summaries in literature. One of the newest methods in text summarization is the Latent Semantic Analysis (LSA) method. In this thesis, different LSA based summarization algorithms are explained and two new LSA based summarization algorithms are proposed. The algorithms are evaluated on Turkish and English documents, and their performances are compared using their ROUGE scores.
Subject Keywords
Semantics
URI
http://etd.lib.metu.edu.tr/upload/12612988/index.pdf
https://hdl.handle.net/11511/20354
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Text summarization using Latent Semantic Analysis
Ozsoy, Makbule Gulcin; Alpaslan, Ferda Nur; Çiçekli, İlyas (SAGE Publications, 2011-08-01)
Text summarization solves the problem of presenting the information needed by a user in a compact form. There are different approaches to creating well-formed summaries. One of the newest methods is the Latent Semantic Analysis (LSA). In this paper, different LSA-based summarization algorithms are explained, two of which are proposed by the authors of this paper. The algorithms are evaluated on Turkish and English documents, and their performances are compared using their ROUGE scores. One of our algorithms...
Object Detection with Convolutional Context Features
Kaya, Emre Can; Alatan, Abdullah Aydın (2017-01-01)
A novel extension to Huh B-ESA object detection algorithm is proposed in order to learn convolutional context features for determining boundaries of objects better. For input images, the hypothesis windows and their context around those windows are learned through convolutional layers as two parallel networks. The resulting object and context feature maps are combined in such a way that they preserve their spatial relationship. The proposed algorithm is trained and evaluated on PASCAL VOC 2007 detection ben...
Global skeleton
Gençtav, Murat; Alpaslan, Ferda Nur; Çiçekli, İlyas; Department of Computer Engineering (2011)
Text summarization solves the problem of presenting the information needed by a user in a compact form. There are different approaches to create well formed summaries in literature. One of the newest methods in text summarization is the Latent Semantic Analysis (LSA) method. In this thesis, different LSA based summarization algorithms are explained and two new LSA based summarization algorithms are proposed. The algorithms are evaluated on Turkish and English documents, and their performances are compared u...
Modular verification of synchronization with reentrant locks
Bultan, Tevfik; Yu, Fang; Betin Can, Aysu (2010-07-28)
We present a modular approach for verification of synchronization behavior in concurrent programs that use reentrant locks. Our approach decouples the verification of the lock implementation from the verification of the threads that use the lock. This decoupling is achieved using lock interfaces that characterize the allowable execution order for the lock operations. We use a thread modular verification approach to check that each thread obeys the lock interface. We verify the lock implementation assuming t...
Multi–target implementation of a domain specific language for extended feature models
Demirtaş, Görkem; Oğuztüzün, Mehmet Halit S.; Department of Computer Engineering (2018)
Translation of feature models to constraint logic programs is an effective method to enable their automated analysis using existing constraint solvers. More flexibility can be offered for building and application of analysis operations on extended feature models by providing a syntax and mechanism for interfacing the host solver with user defined constraint predicates. These constraints, such as global constraints, can be provided by the constraint solver runtime or by the translator itself as a part of the...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. G. Özsoy, “Text summarization using latent semantic analysis,” M.S. - Master of Science, Middle East Technical University, 2011.