Articles

A theory of interlanguage (IL) lexicons is outlined, with emphasis on IL lexical entries, based on the HPSG notion of lexical sign. This theory accounts for idiosyncratic or lexical transfer of syntactic subcategorisation and idioms from the first language to the IL. It also accounts for developmental stages in IL …...

This note introduces at, English-to-Korean Machiue 'lYanslation System MA!t'ES/EK, which ha.s been de- veloped as a research prototype and is still under up- grading in KAIST (Korea Advanced Institute of Sci- ence and Technology). MATES/EK is a transfl:r.-ba.~ed system and it has several subsystems tt, at can be used to …...

DBMT is researched lm,'e in the context of future systems for the general public, where :t monolingual author wants to translate into several languages. We have produced a complete mock-up, IADIA-1, which demonslrales how ;| French IlyperCard TM stack could lie translated into German, Russian and English. We present Ihe …...

This paper i)roposes an effective parsing nicthod for examlile-based machine transhltiOl~. In this method, an input string is parsed by the tOl)-down aplflication of linguistic patterns consisting ol variables and constituent boundaries. A constituent boundary is expressed by either a functional word or a l)art-of..speech bigram. When structural ambiguity occurs, …...

This paper addresses an important problem in Example-Based Machine Translation (EBMT), namely how to measure similarity between a sentence fragment and a set of stored examples. A new method is proposed that measures similarity according to both surface structure and content. A second contribution is the use of clustering to …...

A methodology is presented for coml)onent-l)ase(l machine translation (MT) evaluation through causal error analysis to complement existing global evalu- ation methods. This methodology is particularly :q)- propriate for knowledgc-I)ased machine translation (KBMT) systems. After a discussion o[ M'I' eval- uation criteria and the particular evahlatiou metrics proposed for KBMT, we …...

In an interlingual knowledge-based machine trans- lation system, ambiguity arises when the source 1.qn- guage analyzer produces more than one interlingua expression for a source sentence. This can have a negative impact on translation quality, since a tar- get sentence may be produced from an unintended meaning. In this paper …...

in this paper, we describe the acquisition iuld (Irga- nization of knowledge sources fur machine translation (MT) systems. It has heen liointed out by many users that one of the most annoying things idmtlt MT sys-- terns is tim repeated occurrence of identical errors in word sense and attachment dlsambiguation. …...

In free word order languages, every s('.ni;cn(:(~ is cml)eddcd in its specific contexL The order of consl;ituenLs is d('tcrmincd l)y the categories theme, theme and contrastive J'oc'us. This pa- per shows [low to recognisc mid to transhti,e these cat;egorles autom;~t;ically on ;~ serH,e.n- tial basis, so that SCilI;ClIC(.' ('ml)edding; can …...

A method for generating a machine translation (MT) dictionary from parallel texts is described. This method utilizes both statistical information and linguistic information to obtain corresponding words or phrases in parallel texts. By combining these two types of information, translation pairs which cannot be obtained by a linguistic-based method can …...

A comparison W~LS made of vectors derived by using ordinary co-occurrence statistics from large text cor- pora and of vectors derived by measuring the inter- word distances in dictionary definitions. The precision of word sense disambiguation by using co-occurrence vectors frorn the 1987 Wall Street Journal (20M total words) was …...

; When using i~ third l;mgu;~g(' to const:rl,(:t a bilin- gum dictionary, it is necessary t;o discriminate equiwflencies from imwprol)riat:o words deriw~d as ,~ resnll; of ambiguity in I:hc third lat<gmtge. We propose it metho(l 1:o t;re,d: this by utilizing the strucl;llr(m of di(:donari(,s to measm'(~ die near. n(,ss of …...

To provide practical spelling checkers on micro-com- puters, good compression algorithms ,'~'c essenlial. CutTeut techniques used to compress lexicons for indo-Fmropean languages provide efficient spelling checker. Applying the .~une methods to languages which have a different morpho- logical system (Arabic, Turkish,...) gives insufficient re- suits. To get better results, we …...

It is possible to manipulate real-size human-oriented dictionaries on a Macintosh by using only very simple tools. Our methodology has been applied in the construction of a l:rench-Fnglish-Malay dictionary. This dictionary has been obtained by "crossing" .~mi-aulomatically two bilingual dictionaries. "1"o revise Ihe dictionary, Its well Its to obtain a …...

We propose a lexical organisation fi)r mullilingual lcxical databases (MLDB). This organisation is based on acceptions (word-senses). We detail this lexical organisation m~d show a mock-up built to experiment with it. We also present our current work in defining and prototyping a specialised system for the manage,ncnt of acception-based M …...

We describe an approach to semiautomatic lex- icon development from |nachine readal)le dictio- naries with specific reference to verbal diatlleses, envisaging ways in which tile results obtained can be used to guide word classification in the con- strnction of dictionary datal)ases. 1...

: This paper is an introdnction to KASSYS, a system that has been designed to extract information from detining statements in natural language. Only hy- peronymous detinitions are dealt with here, for which systematic processing has been devised and itnl)lenmnted in tlte initial version of the system. The paper describes …...

This paper is on dividing non-separated language sen- tences (whose words are not separated from each other with a space or other separaters) into morphemes using statistical information, not grammatical infor- mation which is often used in NLP. In this paper we describe our method and experimental result on Japanese …...

(hmpled-Cmltext--l:ree (lrammars are a t~eneralizati(m of context-free, grammars obtained by combining nonter- minals to parcnthescs which can only be substituted si- mnltaneously, l/efl~rring to the generative capacity of the grammars we obtain an inlinite ]licrarchy <)f lanl4uages that comprlscs the context-free languages as the first and all the lattguages generated …...

This paper presents a unified approach to parsing, in which top-down, bottom- up and left-corner parsers m:e related to preorder, postorder and inorder tree traversals. It is shown that the sim- plest bottom-up and left-corner parsers are left recursive and must be con- verted using an extended Greibach nor- mal …...