Re: [lojban] semantic parser - tersmu-0.1rc1

[Jorge Llambías <jjllambias@gmail.com>]

On Fri, Dec 9, 2011 at 2:07 PM, John E. Clifford <kali9putra@yahoo.com> wrote:
> On Dec 9, 2011, at 9:24 AM, Jorge Llambías <jjllambias@gmail.com> wrote:
>> On Thu, Dec 8, 2011 at 8:39 PM, John E. Clifford <kali9putra@yahoo.com> wrote:
>>
>>> Except that quantifiers, unlike negations, introduce references to things.
>>
>> In the sense that they need a domain of quantification? Yes. And the
>> domain of quantification should be maintained for quantifier "terms"
>> that are shared by eks or giheks.
>
> Not domain, instances are the problem.

Quantifiers do not introduce any reference to instances. That's just
not what quantifiers do. Quantifiers don't refer. They count. And when
a "quantifier term" is shared by two branches of a conjunction, the
count must of course be the same for each branch, and the domain must
of course be the same for each branch, but that's all. That's just
like when a quantifier is under the scope of another. "ro da su'o de"
is not much different from "(... .e ... .e ... .e ...) su'o de", and
not much different from "ro da (... .a ... .a ... .a ...)" and not
much different from "(... .e ... .e ... .e ...) (... .a ... .a ... .a
...)".

(Of course there are important differences, such as the connective
form requiring individual names for each member of the domain, or the
quantifier form allowing for an indefinite number of members in the
domain. But these differences don't affect the issue at hand, which is
what has scope over what.)

Quantifiers don't refer. Quantifiers count. I don't know why this
point needs to be made over and over again.


> Well, of course, I don't think donkey sentences are problems; we know exactly how to handle them and always have.  they do present problems for rules of your sort which try to take items one at a time and in order, rather than a more global (at least context-sensitive) approach.  As soon as you assign a {su'o} to all "floating" variables, you have eliminated the possibility of donkey sentences, which may or may not cripple your results, but seems rather arbitrary, given how natural languages work.

I don't agree donkey anaphora are to be equated with implicitly bound
variables.

In any case, I refuse to discuss donkey anaphora before we settle the
(in my opinion trivial) issue of the expansion of eks and giheks, and
the movement of "quantifier terms" and "negation terms" to the prenex
in the first place, and the (not so trivial but still realtively easy)
issue of implicitly bound variables. Trying to discuss donkey anaphora
without those two prior issues settled is in my opinion pointless.

> Again, this is a theoretical ( even aesthetic) comment.  The needs of a speakable language override logical clarity.  If the crude rules always give the right results, what's the problem? Even a little braggadocio does no harm.  But a bit of concern with justifying the rules by something other than their results wouldn't hurt either.

The unpacking rules I propose are not based on their results, although
of course their giving the desired result is obviously a plus.

The rules are based on the observation that quantifiers and
connectives are ultimately at some level the same kind of logical
construct, and should therefore be treated basically in the same way.

(I just said I wouldn't discuss donkey anaphora before settling eks
and giheks, but I can't refrain from pointing out that donkey anaphora
can turn up with connectives as easily as they do with quantifiers, as
in for example: "Everyone who loves either Mary or Jane wants to marry
her.")

mu'o mi'e xorxes

-- 
You received this message because you are subscribed to the Google Groups "lojban" group.
To post to this group, send email to lojban@googlegroups.com.
To unsubscribe from this group, send email to lojban+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/lojban?hl=en.