Presentation is loading. Please wait.

Presentation is loading. Please wait.

Anna Sågvall Hein, GSLT, January 2003 A grammar rule SVE.GRAM CL.IMP --------------- :=: 'CL, :=: 'IMP, = 'VERB, :=: 'VERB, = 'IMP, :=:, :=:, :=:, ADVANCE,

Similar presentations


Presentation on theme: "Anna Sågvall Hein, GSLT, January 2003 A grammar rule SVE.GRAM CL.IMP --------------- :=: 'CL, :=: 'IMP, = 'VERB, :=: 'VERB, = 'IMP, :=:, :=:, :=:, ADVANCE,"— Presentation transcript:

1 Anna Sågvall Hein, GSLT, January 2003 A grammar rule SVE.GRAM CL.IMP :=: 'CL, :=: 'IMP, = 'VERB, :=: 'VERB, = 'IMP, :=:, :=:, :=:, ADVANCE, (ADVERBIALS1// CONTINUE), DO( ), DO( ), ADVANCE, (ADVERBIALS2, ADVANCE// CONTINUE), (END.OF.SENT, STORE/ CL_COORD); Inactive filter WORD.CAT or PHR.CAT;

2 Anna Sågvall Hein, GSLT, January 2003 Transfer rules copy feature delete feature transfer feature define feature

3 Anna Sågvall Hein, GSLT, January 2003 Copy feature LABEL TYPE SOURCE = ?TYPE TARGET = ?TYPE TRANSFER

4 Anna Sågvall Hein, GSLT, January 2003 Delete feature LABEL REG SOURCE = ANY TARGET = TRANSFER

5 Anna Sågvall Hein, GSLT, January 2003 Transfer feature LABEL OBJ.DIR SOURCE = ?OBJ.DIR1 TARGET = ?OBJ.DIR2 TRANSFER ?OBJ.DIR1 ?OBJ.DIR2

6 Anna Sågvall Hein, GSLT, January 2003 Define feature LABEL växellåda SOURCE = noun = växellåda.nn.1 TARGET = noun = gearbox.nn.1 TRANSFER

7 Anna Sågvall Hein, GSLT, January 2003 A contextual lexical rule % i universalstativ  on universal stand LABEL i_universalstativ SOURCE = pp = i.pp.1 = prep = ?x1 = universalstativ.nn.1 TARGET = pp = on.pp.1 = prep = ?x2 TRANSFER ?x1  ?x2

8 Anna Sågvall Hein, GSLT, January 2003 A generation rule LABEL CL.IMP X1 ---> X2 X3 X4 : = CL = = IMP =

9 Anna Sågvall Hein, GSLT, January 2003 A trace

10 Anna Sågvall Hein, GSLT, January 2003 Language modules in the new organisation of MULTRA dictionary in a database with different views excl. contextually defined lexical transfer rules Swedish grammar (excl. morfologi) transfer grammar –incl. contextually defined lexical transfer rules generation grammar (excl. morphology) –temporary generation dictionary (lexemes)

11 Anna Sågvall Hein, GSLT, January 2003 The lexical database sv-en_LinkLexicon en_Inflections en_LemmaLexicon en_LexemeLexicon en_Lexicon en_StemLexicon sv_Inflections sv_LemmaLexicon sv_LexemeLexicon sv_Lexicon sv_StemLexicon

12 Anna Sågvall Hein, GSLT, January 2003 Scaling up the dictionary Swedish lemmas English lemmas befor now

13 Anna Sågvall Hein, GSLT, January 2003 Scaling up the Swedish-English lexeme dictionary word alignment with UWA lemmatising the Swedish one-word-units in the word links heuristic lemmatisation of the English counterparts basic cleaning professionell revision genereration of lexemes

14 Anna Sågvall Hein, GSLT, January 2003 The MATS process in 10 steps 1.extracting text sentences from SGML-dokuments 2.tokenisation 3.extracting lemmas (SL+TL), lexemes (SL + TL), linguistic codes and valency rules form the db. 4.expansion av lemma-, lexeme- och valency codes 5.mosy-code  av-strukture 6.parsing

15 Anna Sågvall Hein, GSLT, January transfer + syntactisk generation 7. av-strukture  mosy-code 8. dictionary look-up in db 9. finish (capital letter etc.) 10. recreate SGML Continuation (steps 7-11)

16 Anna Sågvall Hein, GSLT, January 2003 Lexicalistic translation Identify (lexical) translation units in the source sentence Translate each unit separately (considering the context) Order the result in agreement with a model of the target language (formulation due to Lars Ahrenberg; see further the KOMA project) See also Beaven, L. John, Shake-and-Bake Machine Translation. Coling – 92, Nantes, Aout 1992.

17 Anna Sågvall Hein, GSLT, January 2003 Lexicalistic systems? Systran? Multra? Scots

18 Anna Sågvall Hein, GSLT, January 2003 Interlingua translation See SN

19 Anna Sågvall Hein, GSLT, January 2003 Assignment 2: Hable Con Ella (babelfish) Translate the text from English to one of your favourite languages using Babelfish Make a general quality assessment of the translation. Specify what transfer rules were applied Formulate them in the Multra formalism Specify the translation errors that were made and discuss how they may be handled.


Download ppt "Anna Sågvall Hein, GSLT, January 2003 A grammar rule SVE.GRAM CL.IMP --------------- :=: 'CL, :=: 'IMP, = 'VERB, :=: 'VERB, = 'IMP, :=:, :=:, :=:, ADVANCE,"

Similar presentations


Ads by Google