21.04.2013 Views

Eckhard Bick - VISL

Eckhard Bick - VISL

Eckhard Bick - VISL

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

processors used by translators or language students. In order to achieve full running<br />

machine translation, however, translating base forms obviously isn’t enough. I have<br />

therefore written two additional programs, permut and danmorf, that handle the<br />

generation of (Danish) TL syntax and TL morphology, respectively. From a<br />

performative point of view, permut is not too different from a CG system, since it (a)<br />

is compiled from a set of context sensitive grammatical rules, and (b) works by<br />

string manipulation, treating sentences as word-&-tag strings. The difference is that<br />

permut, unlike a CG, not only removes and adds information, but also replaces<br />

information and - primarily - changes the order of words, groups and clauses - in<br />

some cases even that of morphemes. Permut handles things like complex tenses, NPagreement,<br />

enclitic articles and pronouns, incorporated (elliptic) pronouns and<br />

pronoun anaphora, group-clause and clause-group conversion, reflexivity removal<br />

and addition, prepositional “case”, incorporating verbs, main- and subclause word<br />

order etc. Danmorf takes as input translated base forms (from trad and the<br />

translation mapping CG) as well as attached word class and inflexional information<br />

(modified by permut), and generates (Danish) target language word forms in the<br />

order specified by permut. To this end, danmorf integrates a Danish base form<br />

lexicon with PoS and inflexion class information.<br />

Even without the use of the CG translation mapping module (i.e. only using<br />

the valency and semantic feature instantiation performed by trad), permut and<br />

danmorf can turn the parser’s Portuguese output into intelligible running Danish<br />

text:<br />

(1) live, CG based, machine translation<br />

Though the system's present MT is often fairly crude for longer sentences, this is due<br />

to the fact that the semantic rule body is still quite small in comparison with the<br />

parser’s morphological and syntactic disambiguation rules. Long term, MT<br />

perspectives seem promising, and in principle, the system can be made to handle all<br />

kinds of semantic and structural distinctions, provided that the necessary CG rules<br />

are added for mapping and feature instantiation.<br />

- 434 -

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!