#### Filter Results:

- Full text PDF available (31)

#### Publication Year

1992

2017

- This year (3)
- Last 5 years (15)
- Last 10 years (25)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Dick de Jongh, Makoto Kanazawa
- COLT
- 1996

We extend Angluin s theorem to char acterize identi ability of indexed families of r e languages as opposed to indexed families of recursive languages We also prove some variants characterizing conservativity and two other similar restrictions paralleling Zeug mann Lange and Kapur s results for indexed families of recursive languages

- MAKOTO KANAZAWA
- 2001

A certain prima facie implausible idea about the semantics of donkey pronouns has found a surprising number of adherents (Davies 1981, Lappin 1989, Neale 1990, Lappin and Francez 1994, Yoon 1994, 1996, Krifka 1996a) and even crept into a textbook (Larson and Segal 1995).1 According to this idea, syntactically singular donkey pronouns like it in (1) are… (More)

- Makoto Kanazawa
- Journal of Logic, Language and Information
- 1992

- Makoto Kanazawa
- Journal of Logic, Language and Information
- 1996

- Makoto Kanazawa
- ACL
- 2007

We show that the problems of parsing and surface realization for grammar formalisms with “context-free” derivations, coupled with Montague semantics (under a certain restriction) can be reduced in a uniform way to Datalog query evaluation. As well as giving a polynomialtime algorithm for computing all derivation trees (in the form of a shared forest) from… (More)

- Makoto Kanazawa
- Developments in Language Theory
- 2009

Seki et al. (1991) proved a rather weak pumping lemma for multiple context-free languages, which says that any infinite m-multiple context-free language contains a string that is pumpable at some 2m substrings. We prove a pumping lemma of the usual universal form for the subclass consisting of well-nested multiple context-free languages. This is the same… (More)

- Makoto Kanazawa
- Journal of Logic, Language and Information
- 2010

Second-order abstract categorial grammars (de Groote 2001) and hyperedge replacement grammars (see Engelfriet 1997) are two natural ways of generalizing “context-free” grammar formalisms for string and tree languages. It is known that the string generating power of both formalisms is equivalent to (non-erasing) multiple context-free grammars (Seki et al.… (More)

I present a complete calculus for mixed inference (van Benthem 1991) with composition and prove that it has the finite model property and is therefore decidable. I also present a variant of the calculus complete with respect to deterministic models, and mention the completeness and (un)decidability of other styles of inference involving composition,… (More)

- Makoto Kanazawa
- Journal of Logic, Language and Information
- 2004

- Eric McCready, Daniel Gutzmann, +6 authors Wataru Uegaki
- 2010

This paper provides a system capable of analyzing the combinatorics of a wide range of conventionally implicated and expressive constructions in natural language via an extension of Potts’s (2005) LCI logic for supplementary conventional implicatures. In particular, the system is capable of analyzing objects of mixed conventionally implicated/expressive and… (More)