Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
TL |
2023-12-23 13:45 |
Online |
National Tsing Hua University(Taiwan) (Primary: Online, Secondary: On-site) |
How reading aloud and shadowing affect Japanese EFLlearners' grammatical knowledge and processing Yasuhiro Shimizu, Yokokawa Hirokazu (Kobe Univ.) TL2023-35 |
This study conducted an experiment to investigate the effects of reading aloud, shadowing, and explicit grammatical info... [more] |
TL2023-35 pp.25-30 |
ET |
2023-12-16 10:40 |
Okayama |
Tsushima Campus,Okayama University |
A Proposal of Commentary Function for Understanding Hard Topics in Java Programming Learning Assistant System Yanhui Jing, Nobuo Funabiki, Soe Thandar Aung, Xiqin Lu, Khaing Hsu Wai (Okayama Univ.), Kiyoshi Ueda (Nihon Univ.) ET2023-36 |
Nowadays, Java has been used in a variety of application systems as a highly portable object-oriented programming langua... [more] |
ET2023-36 pp.1-6 |
ET |
2023-12-16 11:05 |
Okayama |
Tsushima Campus,Okayama University |
A Study of Grammar-Concept Understanding Problem for SQL Python Database Programming Learning Assistant System Ni Wayan Wardani, Nobuo Funabiki, Abdul Rahman Patta, Xiqin Lu (Okayama Univ.), I Nyoman Agus Suarya Putra (INSTIKI) ET2023-37 |
Currently, SQL (Structured Query Language) and Python programming are being taught in numerous universities and professi... [more] |
ET2023-37 pp.7-12 |
RCC, ISEC, IT, WBS |
2023-03-14 14:15 |
Yamaguchi |
(Primary: On-site, Secondary: Online) |
Construction of Grammar-Based Codes Using the LZ78 Code and Its Variants Mitsuharu Arimura (Shonan Inst. Tech.) IT2022-103 ISEC2022-82 WBS2022-100 RCC2022-100 |
It is shown by Kieffer and Yang that Lempel-Ziv78 (LZ78) method can be implemented as a variation of grammar-based code.... [more] |
IT2022-103 ISEC2022-82 WBS2022-100 RCC2022-100 pp.224-229 |
IN, NS (Joint) |
2023-03-03 12:00 |
Okinawa |
Okinawa Convention Centre + Online (Primary: On-site, Secondary: Online) |
A Proposal of Two Types of Exercise Problems for TCP/IP Programming Learning by C Language Xiqin Lu, Nobuo Funabiki, Inzali Naing (Okayama Univ.), Htoo Htoo Sandi Kyaw (TUAT), Kiyoshi Ueda (Nihon Univ.) NS2022-236 |
Since computer networks have become essential infrastructure in modern societies, programming skills to support them are... [more] |
NS2022-236 pp.396-401 |
IT |
2022-07-21 14:55 |
Okayama |
Okayama University of Science (Primary: On-site, Secondary: Online) |
A Data Compression Method Where The Codeword Is a Computer Program Generating The Data Mitsuharu Arimura (Shonan Inst. Tech.) IT2022-19 |
The Kolmogorov complexity of a string is defined as the shortest length of the program on a Turing machine used to repre... [more] |
IT2022-19 pp.18-23 |
PRMU, IPSJ-CVIM |
2022-03-11 10:15 |
Online |
Online |
Context free grammar with tree structure analysis for online handwritten mathematical expression recognition Naruki Kitashima, Cuong Tuan Nguyen, Ikuko Shimizu, Masaki Nakagawa (TUAT) PRMU2021-76 |
In mathematics exams, descriptive questions are effective for measuring the comprehension of examinees, but marking hand... [more] |
PRMU2021-76 pp.103-108 |
COMP |
2022-03-06 10:00 |
Online |
Online |
An Ambiguity Hierarchy of Weighted Context-free Grammars Yusuke Inoue, Kenji Hashimoto, Hiroyuki Seki (Nagoya Univ.) COMP2021-31 |
Weighted context-free grammar (WCFG) is a quantitative extension of context-free grammar (CFG). It is known that unambig... [more] |
COMP2021-31 pp.1-7 |
COMP |
2021-03-08 17:30 |
Online |
Online |
On generative capacity of controlled right linear grammars with unknown behaviors Daihei Ise, Satoshi Kobayashi (UEC) COMP2020-38 |
In the design of DNA computers, it has been anticipated to develop a method to implement DNA computers which can select ... [more] |
COMP2020-38 pp.59-66 |
SS |
2021-03-03 10:00 |
Online |
Online |
Weighted Multiple Context-free Grammars and their Properties Yusuke Inoue, Hiroyuki Seki (Nagoya Univ.) SS2020-28 |
Multiple context-free grammar (MCFG) is an extension of context-free grammar that generates tuples of strings. MCFG has ... [more] |
SS2020-28 pp.1-6 |
MSS, SS |
2021-01-27 15:25 |
Online |
Online |
Pumping Lemmas for Languages Expressed by Computational Models with Registers Rindo Nakanishi, Ryoma Senda (Nagoya Univ.), Yoshiaki Takata (KUT), Hiroyuki Seki (Nagoya Univ.) MSS2020-41 SS2020-26 |
Register automaton (RA), register context-free grammar (RCFG), and register tree automaton (RTA) are computational model... [more] |
MSS2020-41 SS2020-26 pp.72-77 |
PRMU |
2020-10-10 10:00 |
Online |
Online |
Phonemic and Moraic Syllables
-- Linguistic Humans Were Born in South African Caves -- Kumon Tokumaru (Writer) PRMU2020-33 |
Digital Linguistics identifies that phonemic and moraic nature of syllables are transduced into text and binary, and tha... [more] |
PRMU2020-33 pp.93-98 |
MSS, NLP (Joint) |
2020-03-09 17:50 |
Aichi |
(Cancelled but technical report was issued) |
Formalization of Modalities in Fillmore's Case Grammar for Language Characterization. Shuji Harazoe (Yamaguchi Univ.), Ren Wu (Yamaguchi JC.), Hiroshi Matsuno (Yamaguchi Univ.) MSS2019-61 |
Modality is a grammatical category that expresses a speaker's will and attitude, which is an essential element of langua... [more] |
MSS2019-61 pp.19-24 |
COMP |
2019-12-13 16:00 |
Gunma |
Ikaho Seminar House, Gunma University |
Improvement of complexity of control system of Regular Grammars with Unknown Behaviors Nobuya Kimoto, Satoshi Kobayashi (UEC) COMP2019-40 |
It has been required to construct universal system for generating target DNA nano-structure by controlling it with exter... [more] |
COMP2019-40 pp.77-84 |
NLP, MSS (Joint) |
2019-03-15 15:30 |
Fukui |
Bunkyo Camp., Univ. of Fukui |
Formalization Method for Language Classification Based on Case Grammar Shuji Harazoe, Natsuki Kamiya (Yamaguchi Univ.), Ren Wu (Yamaguchi JC.), Hiroshi Matsuno (Yamaguchi Univ.) MSS2018-94 |
Tree and wave theories have been employed for language classification. More studies based on tree theory were performed ... [more] |
MSS2018-94 pp.69-74 |
MSS, SS |
2019-01-16 09:50 |
Okinawa |
|
Extending Narrowing Trees to Basic Narrowing in Term Rewriting Yuya Maeda, Naoki Nishida, Masahiko Sakai, Tomoya Kobayashi (Nagoya Univ.) MSS2018-68 SS2018-39 |
Narrowing computation of a term rewriting system is an extension of rewriting by replacing matching with unification, wh... [more] |
MSS2018-68 SS2018-39 pp.73-78 |
TL |
2018-10-28 11:55 |
Hokkaido |
National Institute of Technology, Hakodate College |
[Invited Talk]
Information Structure in LFG
-- Formalisation of the Person Constraint -- Ryo Otoguro (Waseda U.) TL2018-39 |
LFG is a constraint-based grammatical framework, in which distinct structures are organised in a parallel fashion. In ad... [more] |
TL2018-39 pp.1-5 |
COMP |
2018-10-26 10:15 |
Kyoto |
Kyoto University |
Regular Grammars with Unknown Behaviors and its Control Nobuya Kimoto (UEC), Ken Komiya (TITECH), Kenzo Fujimoto (JAIST), Satoshi Kobayashi (UEC) COMP2018-21 |
It has been required to construct universal system for generating target DNA nano-structure by controlling it with exter... [more] |
COMP2018-21 pp.1-8 |
ET |
2018-03-03 13:10 |
Kochi |
Kochi University of Technology (Eikokuji Campus) |
Development of Management Support Systems Accommodating a Variety of Research Activity in University Laboratory Takuma Oura, Yoshiki Sato, Yasuhiko Morimoto (Tokyo Gakugei Univ.), Hiroki Nakayama (Waseda Univ.), Shoichi Nakamura (Fukushima Univ.), Youzou Miyadera (Tokyo Gakugei Univ.) ET2017-95 |
When conducting research in the university laboratory, it is important that all students independently execute four impo... [more] |
ET2017-95 pp.35-40 |
KBSE |
2018-03-02 13:40 |
Okinawa |
|
Extraction of Simple Sentences from Technical Documents using Japanese Unification Grammar Kenji Yoshimura, Tsuneo Nakanishi, Hokuto Ototake, Toshifumi Tanabe, Hiroki Furusho (Fukuoka Univ.) KBSE2017-58 |
A software FMEA/HAZOP process, which the authors have proposed, applies modifier words in the dictionary instead of HAZO... [more] |
KBSE2017-58 pp.115-120 |