Re: Universal grammar

"Rob" == Rob Freeman <groups@xxxxxxxxxxxxxxxxxxx> writes:

Rob> LEE Sau Dan wrote:
>> >>>>> "Rob" == Rob Freeman <groups@xxxxxxxxxxxxxxxxxxx> writes:
>>
Rob> Incompressible strings can be our mathematical model for
Rob> human language, and as a model they can be a more compact
Rob> representation for information than rules.
>> More compact: yes. More appropriate? Probably not.

Rob> Lee Sau Dan, Why?

More compact representations are usually in forms that are more
difficult to manipulate. They also lack redundancy, which can help
doing error-detection or even error-recovery.


--
Lee Sau Dan 李守敦 ~{@nJX6X~}

E-mail: danlee@xxxxxxxxxxxxxxxxxxxxxxxxxx
Home page: http://www.informatik.uni-freiburg.de/~danlee
.

Relevant Pages

  • Re: Universal grammar
    ... Rob> Incompressible strings can be our mathematical model for ... Rob> human language, and as a model they can be a more compact ...
    (sci.lang)
  • Re: Universal grammar
    ... there will be no compression. ... Rob> Good, ... Rob> proven some strings are incompressible. ... and as a model they can be a more compact ...
    (sci.lang)
  • Question for plotty
    ... what do you use for the paths on your allotment? ... Did you compact the paths ... with a roller? ...
    (uk.rec.gardening)
  • Re: Universal grammar
    ... Rob> LEE Sau Dan wrote: ... Rob> human language, and as a model they can be a more compact ... is what I mean when I say "Incompressible strings can be our ... mathematical model for human language." ...
    (sci.lang)
  • Re: Universal grammar
    ... Rob> It is more robust because each decision is spread across many ... Rob> elements. ... That's already a kind of redundancy. ... learning etc. literature, Lee Sau Dan. ...
    (sci.lang)
Quantcast