🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: sci.lang.translation
Article #145

Re: universal written language - a protocol for machine translation

#145
From: Lee Sau Dan ~{
Date: Thu, 20 May 1999 00:00
62 lines
3661 bytes
>>>>> "Stefan" == Stefan MUEHLBACHER <SMuehlba@frequentis.com> writes:

    Stefan> I agree that a universial language would simplify the
    Stefan> translation from one natural language into another.

True, provided that the intermediate language can capture the ideas of
the original text as faithfully  as possible (i.e. no insertion and no
omission of any information, including grammatical marked ones such as
gender, tense, case, mood, number, temporal aspect, etc).


    Stefan> But that universial language should have the additional
    Stefan> requirement that its symbols are unambigous and its syntax
    Stefan> is also unambigous.  A natural language normally does not
    Stefan> have this feature.

You  may  be interested  in  Lojban  (http://www.lojban.org/) for  its
unambiguous syntax.


    Stefan> So why must the universial language be WRITTEN? I think it
    Stefan> is much better to invent a universial knowledge or
    Stefan> language representation. This representation need not be
    Stefan> understood directly by anybody, it should be an abstract
    Stefan> representation that can be best handled by computers. 

Without anyone understanding it,  how would you expect the programmers
to implement and *debug* the programs?


    Stefan> It should also provide a management for its symbols to keep
    Stefan> them unambigous without predefining all of them.

Who manages them?  A machine, or a human being?  Does the manager need
to understand the representations directly?


    Stefan> The advantage of this would be: nobody has to learn a new
    Stefan> language, the translation into a natural language is just
    Stefan> a matter of symbol mapping and syntax.

Nobody?  Then  who tells the  computers how to translate  the internal
representations to a natural language?



    Stefan> Is there another reason why your universial language
    Stefan> should be 'written'?

Any  machine representation  can be  "written" down  on paper  using a
well-defined format.  On  the other hand, any written  langauge can be
encoded and  hence represented in a computer.   So, they're equivalent
in terms of expressiveness.  I  can't see any point in arguing whether
this universal language should be "written".



-- 
Lee Sau Dan                     $(0,X)wAV(B(Big5)                    ~{@nJX6X~}(HZ) 
.----------------------------------------------------------------------------.
| http://www.cs.hku.hk/~sdlee                        e-mail: sdlee@cs.hku.hk |
`----------------------------------------------------------------------------'
Technical Details
Message-ID: <7f3e0spise.fsf@faith.csis.hku.hk>
Path: arc1-ca.pugleaf.net!unknown!not-for-mail
References: <7ho49v$nmj$1@nnrp1.deja.com> <01bea217$4218c660$54c011ac@ws6147>

Show Full Headers
Complete Article Headers
X-Google-Language: Japanese,JIS
X-Google-Thread: 15b514,f82743ad9aebddde
X-Google-Attributes: gid15b514,public
X-Google-Thread: 107100,f82743ad9aebddde
X-Google-Attributes: gid107100,public
X-Google-Thread: 100923,f82743ad9aebddde
X-Google-Attributes: gid100923,public
X-Google-Thread: 107fc6,f82743ad9aebddde
X-Google-Attributes: gid107fc6,public
From: sdlee@faith.csis.hku.hk (Lee Sau Dan ~{@nJX6X~})
Subject: Re: universal written language - a protocol for machine translation
Date: 1999/05/20
Message-ID: <7f3e0spise.fsf@faith.csis.hku.hk>
X-Deja-AN: 479874471
References: <7ho49v$nmj$1@nnrp1.deja.com> <01bea217$4218c660$54c011ac@ws6147>
X-Complaints-To: usenet@www.csis.hku.hk
X-Trace: www.csis.hku.hk 927167907 17746 147.8.177.14 (20 May 1999 02:38:27 GMT)
Organization: Department of Computer Science and Information Systems, The University of Hong Kong
NNTP-Posting-Date: 20 May 1999 02:38:27 GMT
Newsgroups: sci.lang.translation,comp.ai.nat-lang,cu.ml.linguist-list,alt.language.artificial