dc.contributor.author | Γαλιώτου, Ελένη | el |
dc.contributor.author | Καρανικόλας, Νικήτας Ν. | el |
dc.contributor.author | Τσουλόφτας, Χριστόδουλος | el |
dc.date.accessioned | 2015-05-24T19:30:24Z | |
dc.date.available | 2015-05-24T19:30:24Z | |
dc.date.issued | 2015-05-24 | |
dc.identifier.uri | http://hdl.handle.net/11400/11076 | |
dc.rights | Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/us/ | * |
dc.source | http://dl.acm.org/citation.cfm?doid=2491845.2491889 | el |
dc.subject | Extractive summarization | |
dc.subject | Εξορυκτική περιληπτική παρουσίαση | |
dc.subject | Stemming | |
dc.subject | Φράγματα | |
dc.subject | Stopwords | |
dc.subject | Εξαιρούμενες λέξεις | |
dc.title | On the effect of stemming algorithms on extractive summarization | en |
heal.type | conferenceItem | |
heal.secondaryTitle | a case study | en |
heal.classification | Computer science | |
heal.classification | Mathematics | |
heal.classification | Πληροφορική | |
heal.classification | Μαθηματικά | |
heal.classificationURI | http://skos.um.es/unescothes/C00750 | |
heal.classificationURI | http://skos.um.es/unescothes/C02437 | |
heal.classificationURI | **N/A**-Πληροφορική | |
heal.classificationURI | **N/A**-Μαθηματικά | |
heal.identifier.secondary | ISBN: 978-145031969-0 | |
heal.identifier.secondary | DOI: 10.1145/2491845.2491889 | |
heal.language | en | |
heal.access | campus | |
heal.recordProvider | Τεχνολογικό Εκπαιδευτικό Ίδρυμα Αθήνας. Σχολή Τεχνολογικών Εφαρμογών. Τμήμα Μηχανικών Πληροφορικής Τ.Ε. | el |
heal.publicationDate | 2013-09 | |
heal.bibliographicCitation | Galiotou, E., Karanikolas, N. N. and Tsoulloftas, C. (2013). On the effect of stemming algorithms on extractive summarization: a case study. 17th Panhellenic Conference on Informatics, (PCI). Thessaloniki, Greece. 19-21 September 2013. pp 300-304. Available from: http://dl.acm.org/citation.cfm?doid=2491845.2491889. | en |
heal.abstract | In this paper, we discuss the efficiency of stemming algorithms and their contribution to the improvement of shallow summarization methods. We describe a benchmarking experiment on the use of two stemming algorithms and two different sets of stopwords in combination with two approaches to extractive summarization in Greek texts. The results of our experimentation show the limits of extractive summarization and stemming algorithms | en |
heal.sponsor | Αριστοτέλειο Πανεπιστήμιο | el |
heal.sponsor | Αλεξάνδρειο Τ.Ε.Ι. | el |
heal.sponsor | The University of Sheffield | en |
heal.sponsor | Πανεπιστήμιο Μακεδονίας | el |
heal.publisher | ACM | el |
heal.fullTextAvailability | true | |
heal.conferenceName | Panhellenic Conference on Informatics | en |
heal.conferenceItemType | full paper |
Οι παρακάτω άδειες σχετίζονται με αυτό το τεκμήριο: