Tetsuya Nasukawa
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Tetsuya Nasukawa has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
Hiroshi Kanayama
IBM Research – Tokyo, 1623-14 Shimotsuruma, Yamato-shi, Kanagawa-ken 242-8502, Japan
4 shared publications- Hiroshi Kanayama
IBM Research -Tokyo
2 shared publications A. Murakami
1 shared publication- Akiko Murakami
IBM Research Tokyo Research Laboratory 1623-14 242-8502 Shimotsuruma Yamato Kanagawa Japan
1 shared publication - Bishwaranjan Bhattacharjee
IBM T. J. Watson Research Center
1 shared publication - Diwakar Punjani
IBM India Research Lab
1 shared publication
Latest Publications
- Open Access
- 1 January 2023
- Published by Association for Computational Linguistics (ACL)
- p. 3923-3931
A Simple Yet Strong Domain-Agnostic De-bias Method for Zero-Shot Sentiment Classification
Yang Zhao, Tetsuya Nasukawa, Masayasu Muraoka, Bishwaranjan Bhattacharjee. Findings of the Association for Computational Linguistics: ACL 2023. 2023.
- 1 January 2023
- Published by Association for Computational Linguistics (ACL)
- p. 3923-3931
Open AccessA Simple Yet Strong Domain-Agnostic De-bias Method for Zero-Shot Sentiment Classification
Yang Zhao, Tetsuya Nasukawa, Masayasu Muraoka, Bishwaranjan Bhattacharjee. Findings of the Association for Computational Linguistics: ACL 2023. 2023.
- 1 January 2020
- Published by IBM in IBM Journal of Research and Development
- Vol. 64 (1/2) , 10:1-10:8
Understanding requirements and issues in disaster area using geotemporal visualization of Twitter analysis
- 1 January 2020
- Published by IBM in IBM Journal of Research and Development
- Vol. 64 (1/2) , 10:1-10:8
Understanding requirements and issues in disaster area using geotemporal visualization of Twitter analysis
- Open Access
- 1 September 2018
- Published by Bright Publisher in IJIIS: International Journal of Informatics and Information Systems
- Vol. 1 (1) , 46-59
Cross-Cultural Comparisons of Review Aspect Importance
Cross-Cultural Comparisons of Review Aspect Importance
- 1 September 2018
- Published by Bright Publisher in IJIIS: International Journal of Informatics and Information Systems
- Vol. 1 (1) , 46-59
Open AccessCross-Cultural Comparisons of Review Aspect Importance
Cross-Cultural Comparisons of Review Aspect Importance
- Open Access
Inverted Bilingual Topic Models for Lexicon Extraction from Non-parallel Data
Topic models have been successfully applied in lexicon extraction. However, most previous methods are limited to document-aligned data. In this paper, we try to address two challenges of applying topic models to lexicon extraction in non-parallel data: 1) hard to model the word relationship and 2) noisy seed dictionary. To solve these two challenges, we propose two new bilingual topic models to better capture the semantic information of each word while discriminating the multiple translations in a noisy seed dictionary. We extend the scope of topic models by inverting the roles of "word" and "document". In addition, to solve the problem of noise in seed dictionary, we incorporate the probability of translation selection in our models. Moreover, we also propose an effective measure to evaluate the similarity of words in different languages and select the optimal translation pairs. Experimental results using real world data demonstrate the utility and efficacy of the proposed models.
Open AccessInverted Bilingual Topic Models for Lexicon Extraction from Non-parallel Data
Topic models have been successfully applied in lexicon extraction. However, most previous methods are limited to document-aligned data. In this paper, we try to address two challenges of applying topic models to lexicon extraction in non-parallel data: 1) hard to model the word relationship and 2) noisy seed dictionary. To solve these two challenges, we propose two new bilingual topic models to better capture the semantic information of each word while discriminating the multiple translations in a noisy seed dictionary. We extend the scope of topic models by inverting the roles of "word" and "document". In addition, to solve the problem of noise in seed dictionary, we incorporate the probability of translation selection in our models. Moreover, we also propose an effective measure to evaluate the similarity of words in different languages and select the optimal translation pairs. Experimental results using real world data demonstrate the utility and efficacy of the proposed models.
- 14 April 2016
- Published by Springer Nature
- p. 40-52
LiCord: Language Independent Content Word Finder
- 30 March 2011
- Published by Cambridge University Press (CUP) in Natural Language Engineering
- Vol. 18 (1) , 83-107
Unsupervised lexicon induction for clause-level detection of evaluations
This article proposesclause-level evaluation detection, which is a fine-grained type of opinion mining, and describes an unsupervised lexicon building method for capturing domain-specific knowledge by leveraging the similar polarities of sentiments between adjacent clauses. The lexical entries to be acquired are calledpolar atoms, the minimum human-understandable syntactic structures that specify the polarity of clauses. As a hint to obtain candidate polar atoms, we usecontext coherency, the tendency for the same polarity to appear successively in a context. Using the overall density and precision of coherency in the corpus, the statistical estimation picks up appropriate polar atoms from among the candidates, without any manual tuning of the threshold values. The experimental results show that the precision of polarity assignment with the automatically acquired lexicon was 83 per cent on average, and our method is robust for corpora in diverse domains and for the size of the initial lexicon.
- 30 March 2011
- Published by Cambridge University Press (CUP) in Natural Language Engineering
- Vol. 18 (1) , 83-107
Unsupervised lexicon induction for clause-level detection of evaluations
This article proposesclause-level evaluation detection, which is a fine-grained type of opinion mining, and describes an unsupervised lexicon building method for capturing domain-specific knowledge by leveraging the similar polarities of sentiments between adjacent clauses. The lexical entries to be acquired are calledpolar atoms, the minimum human-understandable syntactic structures that specify the polarity of clauses. As a hint to obtain candidate polar atoms, we usecontext coherency, the tendency for the same polarity to appear successively in a context. Using the overall density and precision of coherency in the corpus, the statistical estimation picks up appropriate polar atoms from among the candidates, without any manual tuning of the threshold values. The experimental results show that the precision of polarity assignment with the automatically acquired lexicon was 83 per cent on average, and our method is robust for corpora in diverse domains and for the size of the initial lexicon.
- 1 January 2011
- Published by Japanese Society for Artificial Intelligence in Transactions of the Japanese Society for Artificial Intelligence
- Vol. 26 (1) , 273-283
A Sentiment Analysis Method using Tree Transfer Model
- 1 January 2011
- Published by Japanese Society for Artificial Intelligence in Transactions of the Japanese Society for Artificial Intelligence
- Vol. 26 (1) , 273-283
A Sentiment Analysis Method using Tree Transfer Model
- 1 January 2008
- Published by Association for Computational Linguistics (ACL)
- p. 409-416
Textual demand analysis
- 1 January 2008
- Published by Association for Computational Linguistics (ACL)
- p. 409-416
Textual demand analysis
- 20 November 2007
- Published by Springer Nature in International Journal on Document Analysis and Recognition (IJDAR)
- Vol. 10 (3-4) , 147-155
Sentence boundary detection in conversational speech transcripts using noisily labeled examples
- 20 November 2007
- Published by Springer Nature in International Journal on Document Analysis and Recognition (IJDAR)
- Vol. 10 (3-4) , 147-155
Sentence boundary detection in conversational speech transcripts using noisily labeled examples
- Open Access
- 1 January 2006
- Published by Association for Computational Linguistics (ACL)
- p. 355-363
Fully automatic lexicon expansion for domain-oriented sentiment analysis
This paper proposes an unsupervised lexicon building method for the detection of polar clauses, which convey positive or negative aspects in a specific domain. The lexical entries to be acquired are called polar atoms, the minimum human-understandable syntactic structures that specify the polarity of clauses. As a clue to obtain candidate polar atoms, we use context coherency, the tendency for same polarities to appear successively in contexts. Using the overall density and precision of coherency in the corpus, the statistical estimation picks up appropriate polar atoms among candidates, without any manual tuning of the threshold values. The experimental results show that the precision of polarity assignment with the automatically acquired lexicon was 94% on average, and our method is robust for corpora in diverse domains and for the size of the initial lexicon.
- 1 January 2006
- Published by Association for Computational Linguistics (ACL)
- p. 355-363
Open AccessFully automatic lexicon expansion for domain-oriented sentiment analysis
This paper proposes an unsupervised lexicon building method for the detection of polar clauses, which convey positive or negative aspects in a specific domain. The lexical entries to be acquired are called polar atoms, the minimum human-understandable syntactic structures that specify the polarity of clauses. As a clue to obtain candidate polar atoms, we use context coherency, the tendency for same polarities to appear successively in contexts. Using the overall density and precision of coherency in the corpus, the statistical estimation picks up appropriate polar atoms among candidates, without any manual tuning of the threshold values. The experimental results show that the precision of polarity assignment with the automatically acquired lexicon was 94% on average, and our method is robust for corpora in diverse domains and for the size of the initial lexicon.