Makoto Kanazawa | National Institute of Informatics (original) (raw)
Uploads
Papers by Makoto Kanazawa
Journal of Semantics, 2005
Kratzer (1981) discussed a naıve premise semantics of counterfactual conditionals, pointed to an ... more Kratzer (1981) discussed a naıve premise semantics of counterfactual conditionals, pointed to an empirical inadequacy of this interpretation, and presented a modification-partition semantics-which Lewis (1981) proved equivalent to version of his ordering semantics. Subsequently, proposed lumping semantics, a different modification of premise semantics, and argued it remedies empirical failings of ordering semantics as well as of naïve premise semantics. We show that lumping semantics yields truth conditions for counterfactuals that are not only different from what she claims they are, but also inferior to those of the earlier versions of premise semantics.
Proceedings of SALT, Aug 6, 2011
... (2) RECIP{Tom, Dick, Harry}x, y saw(x, y) using the quantifier symbol RECIP, with its restric... more ... (2) RECIP{Tom, Dick, Harry}x, y saw(x, y) using the quantifier symbol RECIP, with its restricted domain {Tom, Dick, Harry} su perscripted and the two variables it binds x, y suffixed, all preceding the quantifier's scope. In terms ...
Linguistics and Philosophy, Apr 1, 1998
The English reciprocal expressions each other and one another vary in meaning according to the me... more The English reciprocal expressions each other and one another vary in meaning according to the meaning of their scope and antecedent, as well as the context in which they are uttered. Variation in the reciprocal's meaning is not just pragmatically determined alteration in speaker's meaning but semantically determined change of literal conditions for strict truth. We will show how to parameterize the dramatic range of observed variation, and wc will formulate a principle which predicts the reciprocal's literal meaning in any context of ...
Linguistics and Philosophy, 1998
Building on Ben-Avi and Winter's (2007) work, this paper provides a general "intensionalization" ... more Building on Ben-Avi and Winter's (2007) work, this paper provides a general "intensionalization" procedure that turns an extensional semantics for a language into an intensionalized one that is capable of accommodating "truly intensional" lexical items without changing the compositional semantic rules. We prove some formal properties of this procedure and clarify its relation to the procedure implicit in Montague's (1973) PTQ.
Drafts by Makoto Kanazawa
IfCoLog Journal of Logics and Their Applications, 2017
Parsing and generation (or surface realization) are two of the most important tasks in the proces... more Parsing and generation (or surface realization) are two of the most important tasks in the processing of natural language by humans and by computers. This paper studies both tasks in the style of formal language theory, using typed λ-terms to represent meanings. It is shown that the problems of parsing and surface realization for grammar formalisms with "context-free" derivations, coupled with a kind of Montague semantics (satisfying a certain restriction) can be reduced in a uniform way to Datalog query evaluation. This makes it possible to apply to parsing and surface realization known efficient evaluation methods for Datalog. Moreover, the reduction has the following complexity-theoretic consequences for all such formalisms: (i) the decision problem of recognizing grammaticality (surface realizability) of an input string (logical form) is in LOGCFL; and (ii) the search problem of computing all derivation trees (in the form of shared forest) from an input string or input logical form is in functional LOGCFL. These bounds are tight. The reduction is carried out by way of "context-free" grammars on typed λ-terms, a relaxation of the second-order fragment of de Groote's abstract categorial grammar. The method works whenever a grammar uses only "almost linear" λ-terms.
Editing by Makoto Kanazawa
Journal of Semantics, 2005
Kratzer (1981) discussed a naıve premise semantics of counterfactual conditionals, pointed to an ... more Kratzer (1981) discussed a naıve premise semantics of counterfactual conditionals, pointed to an empirical inadequacy of this interpretation, and presented a modification-partition semantics-which Lewis (1981) proved equivalent to version of his ordering semantics. Subsequently, proposed lumping semantics, a different modification of premise semantics, and argued it remedies empirical failings of ordering semantics as well as of naïve premise semantics. We show that lumping semantics yields truth conditions for counterfactuals that are not only different from what she claims they are, but also inferior to those of the earlier versions of premise semantics.
Proceedings of SALT, Aug 6, 2011
... (2) RECIP{Tom, Dick, Harry}x, y saw(x, y) using the quantifier symbol RECIP, with its restric... more ... (2) RECIP{Tom, Dick, Harry}x, y saw(x, y) using the quantifier symbol RECIP, with its restricted domain {Tom, Dick, Harry} su perscripted and the two variables it binds x, y suffixed, all preceding the quantifier's scope. In terms ...
Linguistics and Philosophy, Apr 1, 1998
The English reciprocal expressions each other and one another vary in meaning according to the me... more The English reciprocal expressions each other and one another vary in meaning according to the meaning of their scope and antecedent, as well as the context in which they are uttered. Variation in the reciprocal's meaning is not just pragmatically determined alteration in speaker's meaning but semantically determined change of literal conditions for strict truth. We will show how to parameterize the dramatic range of observed variation, and wc will formulate a principle which predicts the reciprocal's literal meaning in any context of ...
Linguistics and Philosophy, 1998
Building on Ben-Avi and Winter's (2007) work, this paper provides a general "intensionalization" ... more Building on Ben-Avi and Winter's (2007) work, this paper provides a general "intensionalization" procedure that turns an extensional semantics for a language into an intensionalized one that is capable of accommodating "truly intensional" lexical items without changing the compositional semantic rules. We prove some formal properties of this procedure and clarify its relation to the procedure implicit in Montague's (1973) PTQ.
IfCoLog Journal of Logics and Their Applications, 2017
Parsing and generation (or surface realization) are two of the most important tasks in the proces... more Parsing and generation (or surface realization) are two of the most important tasks in the processing of natural language by humans and by computers. This paper studies both tasks in the style of formal language theory, using typed λ-terms to represent meanings. It is shown that the problems of parsing and surface realization for grammar formalisms with "context-free" derivations, coupled with a kind of Montague semantics (satisfying a certain restriction) can be reduced in a uniform way to Datalog query evaluation. This makes it possible to apply to parsing and surface realization known efficient evaluation methods for Datalog. Moreover, the reduction has the following complexity-theoretic consequences for all such formalisms: (i) the decision problem of recognizing grammaticality (surface realizability) of an input string (logical form) is in LOGCFL; and (ii) the search problem of computing all derivation trees (in the form of shared forest) from an input string or input logical form is in functional LOGCFL. These bounds are tight. The reduction is carried out by way of "context-free" grammars on typed λ-terms, a relaxation of the second-order fragment of de Groote's abstract categorial grammar. The method works whenever a grammar uses only "almost linear" λ-terms.