Search Results for author: Naoki Kobayashi

Found 8 papers, 3 papers with code

Making Your Tweets More Fancy: Emoji Insertion to Texts

no code implementations RANLP 2021 Jingun Kwon, Naoki Kobayashi, Hidetaka Kamigaito, Hiroya Takamura, Manabu Okumura

The results demonstrate that the position of emojis in texts is a good clue to boost the performance of emoji label prediction.

Position

A Simple and Strong Baseline for End-to-End Neural RST-style Discourse Parsing

1 code implementation15 Oct 2022 Naoki Kobayashi, Tsutomu Hirao, Hidetaka Kamigaito, Manabu Okumura, Masaaki Nagata

To promote and further develop RST-style discourse parsing models, we need a strong baseline that can be regarded as a reference for reporting reliable experimental results.

Discourse Parsing

Toward Neural-Network-Guided Program Synthesis and Verification

1 code implementation17 Mar 2021 Naoki Kobayashi, Taro Sekiyama, Issei Sato, Hiroshi Unno

Another application is to a new program development framework called oracle-based programming, which is a neural-network-guided variation of Solar-Lezama's program synthesis by sketching.

Program Synthesis

A Cyclic Proof System for HFLN

no code implementations28 Oct 2020 Mayuko Kori, Takeshi Tsukada, Naoki Kobayashi

A cyclic proof system allows us to perform inductive reasoning without explicit inductions.

Top-Down RST Parsing Utilizing Granularity Levels in Documents

1 code implementation3 Apr 2020 Naoki Kobayashi, Tsutomu Hirao, Hidetaka Kamigaito, Manabu Okumura, Masaaki Nagata

To obtain better discourse dependency trees, we need to improve the accuracy of RST trees at the upper parts of the structures.

Discourse Parsing Relation

Split or Merge: Which is Better for Unsupervised RST Parsing?

no code implementations IJCNLP 2019 Naoki Kobayashi, Tsutomu Hirao, Kengo Nakamura, Hidetaka Kamigaito, Manabu Okumura, Masaaki Nagata

The first one builds the optimal tree in terms of a dissimilarity score function that is defined for splitting a text span into smaller ones.

Cannot find the paper you are looking for? You can Submit a new open access paper.