This paper describes the specifications and results of SSA-UO, unsupervised system, presented in SemEval 2013 for Sentiment Analysis in Twitter (Task 2) (Wilson et al., 2013). The proposal system includes three phases: data preprocessing, contextual word polarity detection and message classification. The preprocessing phase comprises treatment of emoticon, slang terms, lemmatization and POS-tag...

Different demographics, e.g., gender or age, can demonstrate substantial variation in their language use, particularly in informal contexts such as social media. In this paper we focus on learning gender differences in the use of subjective language in English, Spanish, and Russian Twitter data, and explore cross-cultural differences in emoticon and hashtag use for male and female users. We sho...

This paper describes the system that was submitted to SemEval2015 Task 10: Sentiment Analysis in Twitter. We participated in Subtask B: Message Polarity Classification. The task is a message level classification of tweets into positive, negative and neutral sentiments. Our model is primarily a supervised one which consists of well designed features fed into an SVM classifier. In previous runs o...

Aspek utama yang lebih banyak dipertimbangkan saat berkomunikasi secara tertulis dengan orang lain melalui whatsApp adalah kesantunan. Bahkan, pertimbangan kesantunan jauh tinggi daripada maksud pesan di dalamnya. Walaupun sudah dilengkapi beragam ekspresi (emoticon), hal itu belum cukup untuk menampilkan linguistik pengirim pesan. Oleh karena itu, analisis pada dikirim perlu dilakukan. Secara ...

We use an array given in H. Kharaghani, Arrays for orthogonal designs, J. Combin. Designs, 8 (2000), 166-173, to obtain infinite families of 8-variable Kharaghani type orthogonal designs, OD(8t; hi, kl, kl, kl, k2, k2, k2, k2), where k1 and k2 must be the sum of two squares. In particular we obtain infinite families of 8-variable Kharaghani type orthogonal designs, OD(8t; k, k, k, k, k, k, k, k...

* These c o m p u t e r e x p e r i m e n t s w e r e suppor ted by a g ran t f r o m the F o r d Founda t ion ; and c o m p u t e r t i m e was g ran ted by the M o o r e School o f E l e c t r i c a l E n g i n e e r i n g Compu te r F a c i l i t y .

Let (Xn, dn), n ∈ N be a sequence of pseudo-metric spaces, p ≥ 1. For x, y ∈ ∏n∈NXn, let (x, y) ∈ E((Xn)n∈N; p) ⇔ ∑ n∈N dn(x(n), y(n)) p < +∞. For Borel reducibility between equivalence relations E((Xn)n∈N; p), we show it is closely related to finitely Hölder(α) embeddability between pseudometric spaces.

The fractional covering number r* of a hypergraph H (V, E) is defined to be the minimum possible value of ,, v t(x) where ranges over all functions t: V which satisfy ,xe t(x) >= for all edges e e E. In the case of ordinary graphs G, it is known that 2r*(G) is always an integer. By contrast, it is shown (among other things) that for any rational p/q >= 1, there is a 3-uniform hypergraph H with-...