KANAZAWA Makoto

J-GLOBAL         Last updated: Jun 7, 2018 at 11:48
 
Avatar
Name
KANAZAWA Makoto
Affiliation
Hosei University
Section
Faculty of Science and Engineering, Department of Advanced Sciences
Degree
Ph.D.(Doctor of Philosophy)

Research Areas

 
 

Academic & Professional Experience

 
 
   
 
Associate Professor, National Institute of Informatics 
 
1994
 - 
2000
Associate Professor, Faculty of Letters, Chiba University
 
2000
 - 
2004
Associate Professor, Interfaculty Initiative in Information Studiees, University of Tokyo
 
2004
   
 
- Associate Professor, National Institute of Informatics
 

Education

 
 
 - 
1994
Linguistics, Stanford University
 
 
 - 
1988
Linguistics, Faculty of Literature, The University of Tokyo
 

Misc

 
Angluin's Theorem for Indexed Families of R. E. Sets and Applications
Dick de Jongh and Makoto Kanazawa
Proceedings of the Ninth Annual Conference on Computational Learning Theory, ACM Press      1996
Weak vs. Strong Readings of Donkey Sentences and Monotonicity Inference in a Dynamic Setting
Makoto Kanazawa
Linguistics and Philosophy   17(2) 109-158   1994
Computing word meanings by interpolation
Makoto Kanazawa
Proceedings of the Fourteen Amsterdam Colloquium, ILLC/Department of Philosophy, University of Amsterdam   157-162   2003
Learning word-to-meaning mappings in logical semantics
Makoto Kanazawa
Proceedings of the Thirteen Amsterdam Colloquium, ILLC/Department of Philosophy, University of Amsterdam   126-131   2001
I dentification in the Limit of Categorial Grammars
Makoto Kanazawa
Journal of Logic, Language and Information   5(2) 115-155   1996

Books etc

 
Learnable Classes of Categorial Grammars
CSLI Publications   1998   

Research Grants & Projects

 
Proof theory of implicational propositional logics
Ordinary Research
A formal model of acquisition of word meanings
Ordinary Research
Grammar formalisms based on the lambda calculus
International Collaboration
Reduction of parsing and generation to Datalog query evaluation based on typed lambda calculus
Grant-in-Aid for Scientific Research
Project Year: 2006 - 2009
The problem of parsing and recognition for context-free grammars on lambda terms is reduced to Datalog query evaluation
Prefix-correct Earley parsing of mildly context-sensitive languages
Grant-in-Aid for Scientific Research
Project Year: 2007 - 2009
A prefix-correct Earley-style algorithm for parsing multiple context-free languages is automatically obtained through transformation of Datalog programs