Papers by Hiroshi Noji
Modeling Human Sentence Processing with Left-Corner Recurrent Neural Network Grammars (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing literature is agnostic about a parsing strategy of hierarchical models . a recent study showed that hierarchically model hierarchic structures capture grammatical dependencies much better than RNNs in targeted syntactic evaluations. |
| Approach: | They evaluated three LMs with head-final left-branching structures and Recurrent Neural Network Grammars with top-down and left-corner parsing strategies as hierarchical models. |
| Outcome: | The proposed model outperforms top-down and left-corner models against human reading times in Japanese. |
Learning to Select, Track, and Generate for Data-to-Text (P19-1)
Copied to clipboard
Hayate Iso, Yui Uehara, Tatsuya Ishigaki, Hiroshi Noji, Eiji Aramaki, Ichiro Kobayashi, Yusuke Miyao, Naoaki Okazaki, Hiroya Takamura
| Challenge: | Existing models often refer to the same data record multiple times. |
| Approach: | They propose a data-to-text generation model with two modules, one for tracking and the other for text generation. |
| Outcome: | The proposed model outperforms existing models even without writer information in all evaluation metrics and contributes to content planning and surface realization. |
How Much Syntactic Supervision is “Good Enough”? (2023.findings-eacl)
Copied to clipboard
| Challenge: | RNNGs with syntactic supervision underperformed RNNs with some syntaktic supervision, whereas RNNS with mild supervision achieved the best performance comparable to the state-of-the-art GPT-2-XL. |
| Approach: | They propose a method where syntactic LMs are gradually ablated from full syntatic supervision to zero syntastic supervision by preserving NP, VP, PP, SBAR nonterminal symbols. |
| Outcome: | The proposed method underperforms the RNNGs with zero syntactic supervision, and the LMs with mild syntaktic supervision perform better than the state-of-the-art GPT-2-XL. |
An empirical analysis of existing systems and datasets toward general simple question answering (2020.coling-main)
Copied to clipboard
| Challenge: | evaluators of simple factoid question answering using different datasets are not able to solve SimpleQuestions. |
| Approach: | They evaluate the progress of the field toward solving simple factoid questions over a knowledge base. |
| Outcome: | The proposed model is nearly solved on the most popular dataset, but not on the robustness of existing systems. |
Domain Adaptation of Image Encoder for Multimodal Manga Translation (2026.eacl-srw)
Copied to clipboard
| Challenge: | Existing machine translation systems lack sufficient manga comprehension capabilities when utilizing image information. |
| Approach: | They propose a domain-adapted image encoder training method for manga . the method trains encoders to acquire visual features that consider the structural and sequential characteristics of the manga based on a Japanese-English translation task. |
| Outcome: | The proposed method improves translation evaluation metrics in Japanese-English translation task compared to the conventional method . |
An Analysis of the Utility of Explicit Negative Examples to Improve the Syntactic Abilities of Neural Language Models (2020.acl-main)
Copied to clipboard
| Challenge: | Neural language models are often trained on positive examples, but recent studies suggest they are not robust enough to handle complex syntactic constructions. |
| Approach: | They propose to use negative examples to boost models' robustness on English sentences with a negligible loss of perplexity. |
| Outcome: | The proposed model is robust to negative examples in English with negligible loss of perplexity . |
Automatic Generation of High Quality CCGbanks for Parser Domain Adaptation (P19-1)
Copied to clipboard
| Challenge: | Existing methods for Combinatory Categorial Grammar (CCG) parsing are limited to a specific parser architecture, making it non-trivial to apply to current parsers. |
| Approach: | They propose a domain adaptation method for Combinatory Categorial Grammar (CCG) they propose to generate CCG corpora using cheaper dependency trees. |
| Outcome: | The proposed method improves on speech conversation and math problems. |
Dynamic Feature Selection with Attention in Incremental Parsing (C18-1)
Copied to clipboard
| Challenge: | Currently, incremental transition-based parsers require that all inputs are visible from the beginning to extract good features from a limited local context. |
| Approach: | They propose a technique to maximize local features with an attention mechanism which works as context- dependent dynamic feature selection. |
| Outcome: | The proposed technique can extract features from a limited local context and is able to perform multilingual experiments and demon strate on local ambiguous points. |
An Empirical Investigation of Error Types in Vietnamese Parsing (C18-1)
Copied to clipboard
| Challenge: | Syntactic parsing improves the quality of natural language processing tasks. |
| Approach: | They evaluated Vietnamese Treebank model to find most suitable parsing method . they found that Vietnamese parsers produced limited training data and POS errors . |
| Outcome: | The proposed method improves the parsing quality in Vietnamese . the results highlight three possible sources of parser errors . |
Effective Batching for Recurrent Neural Network Grammars (2021.findings-acl)
Copied to clipboard
| Challenge: | RNNGs are hard to scale due to the difficulty of batched training. |
| Approach: | They propose to batch RNNGs where every operation is computed in parallel with tensors across multiple sentences. |
| Outcome: | The proposed RNNG scales faster than existing models and achieves x6 speedup compared to existing C++ DyNet implementation . |
CharacterBERT: Reconciling ELMo and BERT for Word-Level Open-Vocabulary Representations From Characters (2020.coling-main)
Copied to clipboard
Hicham El Boukkouri, Olivier Ferret, Thomas Lavergne, Hiroshi Noji, Pierre Zweigenbaum, Jun’ichi Tsujii
| Challenge: | Pre-trained language representations from Transformers have become the most popular choice for building NLP systems. |
| Approach: | They propose a new variant of BERT that drops the wordpiece tokenization system altogether . they propose 'characterBERT' module to represent entire words by consulting their characters . |
| Outcome: | The proposed model improves performance on a variety of medical domain tasks while producing robust, word-level, and open-vocabulary representations. |
Consistent CCG Parsing over Multiple Sentences for Improved Logical Reasoning (N18-2)
Copied to clipboard
| Challenge: | Existing methods to recognize textual entailment use a CCG parser to process sentences . failing to recognize the similar syntactic structure results in inconsistent argument structures . |
| Approach: | They propose to extend existing CCG parsers to parse sentences consistently . they use an inter-sentence modeling with Markov Random Fields to achieve this . |
| Outcome: | The proposed method improves on English and Japanese languages. |
Learning with Contrastive Examples for Data-to-Text Generation (2020.coling-main)
Copied to clipboard
Yui Uehara, Tatsuya Ishigaki, Kasumi Aoki, Hiroshi Noji, Keiichi Goshima, Ichiro Kobayashi, Hiroya Takamura, Yusuke Miyao
| Challenge: | Existing models for data-to-text generation generate fluent but sometimes incorrect sentences . Existing studies show that using contrastive examples improves the ability of generating sentences with better lexical choice without degrading the fluency. |
| Approach: | They propose to use models trained on incorrect sentences and learning methods that exploit contrastive examples to reduce such errors. |
| Outcome: | The proposed models generate fluent sentences but often have problematic ones in terms of correctness. |