Makoto Kanazawa

According to our database1, Makoto Kanazawa authored at least 35 papers between 1992 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Learning Context-Free Grammars from Positive Data and Membership Queries.
Proceedings of the Logic, Language, Information, and Computation, 2023

Extending Distributional Learning from Positive Data and Membership Queries.
Proceedings of the International Conference on Grammatical Inference, 2023

2021
A Hierarchy of Context-Free Languages Learnable from Positive Data and Membership Queries.
Proceedings of the 15th International Conference on Grammatical Inference, 2021

2019
Finite-state methods in natural language processing and mathematics of language. Introduction to the special issue.
J. Lang. Model., 2019

Ogden's lemma, multiple context-free grammars, and the control language hierarchy.
Inf. Comput., 2019

2018
On the Recognizing Power of the Lambek Calculus with Brackets.
J. Log. Lang. Inf., 2018

Decision problems for Clark-congruential languages.
Proceedings of the 14th International Conference on Grammatical Inference, 2018

2017
Parsing and Generation as Datalog Query Evaluation.
FLAP, 2017

The Strong, Weak, and Very Weak Finite Context and Kernel Properties.
Proceedings of the Language and Automata Theory and Applications, 2017

2016
Multidimensional trees and a Chomsky-Schützenberger-Weir representation theorem for simple context-free tree grammars.
J. Log. Comput., 2016

Preface.
Fundam. Informaticae, 2016

Distributional Learning of Some Nonlinear Tree Grammars.
Fundam. Informaticae, 2016

2015
Distributional Learning and Context/Substructure Enumerability in Nonlinear Tree Grammars.
Proceedings of the Formal Grammar - 20th and 21st International Conferences, 2015

2014
The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages.
Theory Comput. Syst., 2014

Preface.
Proceedings of the 12th International Conference on Grammatical Inference, 2014

A Generalization of Linear Indexed Grammars Equivalent to Simple Context-Free Tree Grammars.
Proceedings of the Formal Grammar - 19th International Conference, 2014

2013
A Note on Intensionalization.
J. Log. Lang. Inf., 2013

The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars.
Proceedings of the Formal Grammar, 2013

2012
MIX Is Not a Tree-Adjoining Language.
Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, July 8-14, 2012, Jeju Island, Korea, 2012

2011
Preface.
Fundam. Informaticae, 2011

Distributional Learning of Abstract Categorial Grammars.
Proceedings of the Logical Aspects of Computational Linguistics, 2011

Well-Nestedness Properly Subsumes Strict Derivational Minimalism.
Proceedings of the Logical Aspects of Computational Linguistics, 2011

2010
Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars.
J. Log. Lang. Inf., 2010

The Copying Power of Well-Nested Multiple Context-Free Grammars.
Proceedings of the Language and Automata Theory and Applications, 2010

2009
The Pumping Lemma for Well-Nested Multiple Context-Free Languages.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008
A Prefix-Correct Earley Recognizer for Multiple Context-Free Grammars.
Proceedings of the Ninth International Workshop on Tree Adjoining Grammar and Related Frameworks, 2008

2007
Parsing and Generation as Datalog Queries.
Proceedings of the ACL 2007, 2007

2006
Abstract Families of Abstract Categorial Languages.
Proceedings of the 13th Workshop on Logic, Language, Information and Computation, 2006

Computing interpolants in implicational logics.
Ann. Pure Appl. Log., 2006

2005
On the Lumping Semantics of Counterfactuals.
J. Semant., 2005

The Complexity and Generative Capacity of Lexicalized Abstract Categorial Grammars.
Proceedings of the Logical Aspects of Computational Linguistics, 2005

2004
Computational Approaches to Language Acquisition, Michael R. Brent, ed..
J. Log. Lang. Inf., 2004

1996
Indentification in the Limit of Categorial Grammars.
J. Log. Lang. Inf., 1996

Angluin's Theorem for Indexed Families of r.e. Sets and Applications.
Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996

1992
The Lambek calculus enriched with additional connectives.
J. Log. Lang. Inf., 1992


  Loading...