Detecting Emotive Sentences with Pattern-based Language Modelling

Ptaszynski, Michal; Masui, Fumito; Rzepka, Rafal; Araki, Kenji

doi:10.1016/j.procs.2014.08.129


Hokkaido University \| Library \| HUSCAP	Advanced Search		言語

	Home
	About HUSCAP
	Open Access Policy

	Browse by Author

Browse
	Communities & Collections

	Scholarly Journals
	Theses
	Doctoral Dissertations Listed by Graduate Schools
	Conference Procs.
	Events

	HUSCAP Senior (in Japanese)

	Societies

	Downloads (country)

For university staff
	How to post your papers to HUSCAP
	Publication of theses
	Helpline about theses publication

Open Archives Compliant

You can search our collection also at:
	Google
	Google Scholar
	CiNii
	IRDB
	OAIster
	NDLTD

Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >

Detecting Emotive Sentences with Pattern-based Language Modelling

This item is licensed under:Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Files in This Item:

1-s2.0-S1877050914010941-main.pdf

317.79 kB

PDF

View/Open

Please use this identifier to cite or link to this item:http://hdl.handle.net/2115/63685

Title:	Detecting Emotive Sentences with Pattern-based Language Modelling
Authors:	Ptaszynski, Michal Browse this author
	Masui, Fumito Browse this author →KAKEN DB
	Rzepka, Rafal Browse this author →KAKEN DB
	Araki, Kenji Browse this author →KAKEN DB
Keywords:	Brute Force Search Algorithms
	Pattern Extraction
	Language Modelling
	Emotive expressions
	Language Combinatorics
Issue Date:	Sep-2014
Publisher:	Elsevier
Journal Title:	Procedia Computer Science
Volume:	35
Start Page:	484
End Page:	493
Publisher DOI:	10.1016/j.procs.2014.08.129
Abstract:	This paper presents our research in detection of emotive (emotionally loaded) sentences. The task is defined as a text classification problem with an assumption that emotive sentences stand out both lexically and grammatically. The assumption is verified exper- imentally. The experiment is based on n-grams as well as more sophisticated patterns with disjointed elements. To deal with the sophisticated patterns a novel language modelling algorithm based on the idea of language combinatorics is applied. The results of experiments are explained with the standard means of Precision, Recall and balanced F-score. The algorithm also provides a refined list of most frequent sophisticated patterns typical for both emotive and non-emotive context.
Rights:	© 2014, Elsevier. This manuscript version is made available under the CC-BY-NC-ND 3.0 license http://creativecommons.org/licenses/by-nc-nd/3.0/
Rights:	http://creativecommons.org/licenses/by-nc-nd/3.0/
Type:	article
URI:	http://hdl.handle.net/2115/63685
Appears in Collections:	情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)

Submitter: RZEPKA Rafal

OAI-PMH ( junii2 , jpcoar_1.0 )

- Hokkaido University