Please use this identifier to cite or link to this item: https://dspace.upt.ro/xmlui/handle/123456789/5817
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDinca, Nadia Luiza-
dc.date.accessioned2023-05-09T06:09:09Z-
dc.date.available2023-05-09T06:09:09Z-
dc.date.issued2010-
dc.identifier.citationDinca, Nadia Luiza.The internal rules of the example database design. Timișoara: Politehnica University Press, 2010 Disponibil la https://doi.org/10.59168/WTNF8464en_US
dc.identifier.urihttps://dspace.upt.ro/xmlui/handle/123456789/5817-
dc.identifier.urihttps://search.crossref.org/search/works?q=10.59168%2FWTNF8464&from_ui=yes Link DOI-
dc.description.abstractOne of the internal rules of the example-based translation is the dependence of the translation quality on the length and representation of translation examples. These are managed by an example database, for which the linguist should answer two questions when s/he intends to design it: (1) what is the representation chosen for the translation example? and (2) what are the possibilities to generalize the translation examples stored in the database? In this paper my intent is to propose two answers, in fact – a synergetical research direction for Romanian, English and French language. I will consider the representation of the translation examples as depedency trees and I will generalize them by means of the semantic information described by Levin’s verb classes.en_US
dc.language.isoenen_US
dc.publisherUniversitatea Politehnica Timișoaraen_US
dc.relation.ispartofseriesProfessional communication and translation studies;3/ 2010-
dc.subjectmachine translationen_US
dc.subjecttranslation exampleen_US
dc.subjectdependency treeen_US
dc.subjectexample database designen_US
dc.titleThe internal rules of the example database design [articol]en_US
dc.typeArticleen_US
Appears in Collections:Articole științifice/Scientific articles

Files in This Item:
File Description SizeFormat 
BUPT_ART_Dinca Nadia Luiza_f.pdf121.02 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.