| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Search the digital library catalog Help

Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 10 / 14
First pagePrevious page12Next pageLast page
1.
Reduction of Neural Machine Translation Failures by Incorporating Statistical Machine Translation
Jani Dugonik, Mirjam Sepesy Maučec, Domen Verber, Janez Brest, 2023, original scientific article

Abstract: This paper proposes a hybrid machine translation (HMT) system that improves the quality of neural machine translation (NMT) by incorporating statistical machine translation (SMT). Therefore, two NMT systems and two SMT systems were built for the Slovenian-English language pair, each for translation in one direction. We used a multilingual language model to embed the source sentence and translations into the same vector space. From each vector, we extracted features based on the distances and similarities calculated between the source sentence and the NMT translation, and between the source sentence and the SMT translation. To select the best possible translation, we used several well-known classifiers to predict which translation system generated a better translation of the source sentence. The proposed method of combining SMT and NMT in the hybrid system is novel. Our framework is language-independent and can be applied to other languages supported by the multilingual language model. Our experiment involved empirical applications. We compared the performance of the classifiers, and the results demonstrate that our proposed HMT system achieved notable improvements in the BLEU score, with an increase of 1.5 points and 10.9 points for both translation directions, respectively.
Keywords: neural machine translation, statistical machine translation, sentence embedding, similarity, classification, hybrid machine translation
Published in DKUM: 20.02.2024; Views: 239; Downloads: 21
.pdf Full text (400,40 KB)
This document has many files! More...

2.
Lattice embeddings of trees
Wilfried Imrich, Matjaž Kovše, 2009, original scientific article

Abstract: Predstavljen je algoritem časovno linearne zahtevnosti, ki na izometričen način vloži dano drevo ▫$T$▫ v celoštevilsko mrežo najmanjše možne dimenzije in omogoča izračun mrežnih koordinat vozlišč drevesa ▫$T$▫ v optimalnem času.
Keywords: matematika, teorija grafov, drevo, izometrična vložitev, mrežna vložitev, delna kocka, mathematics, graph theory, lattice embedding, isometric embedding, partial cube, tree
Published in DKUM: 10.07.2015; Views: 942; Downloads: 140
URL Link to full text

3.
Partial cubes are distance graphs
Melita Gorše Pihler, Janez Žerovnik, 2008, published scientific conference contribution

Abstract: Chatrand, Kubicki in Schultz [Aequationes Math. 55 (1998) 129-145] so postavili domnevo, da so vsi dvodelni grafi razdaljni grafi. V tem članku pokažemo, da so vsi grafi podmnožice dvodelnih grafov, in sicer delne kocke, razdaljni grafi.
Keywords: matematika, teorija grafov, razdaljni graf, delna kocka, hiperkocka, izometrični podgraf, vložitev, mathematics, graph theory, distance graph, partial cube, hypercube, isometric subgraph, embedding
Published in DKUM: 10.07.2015; Views: 1356; Downloads: 144
URL Link to full text

4.
Tribes of cubic partial cubes
Sandi Klavžar, Sergey Shpectorov, 2007, original scientific article

Abstract: Partial cubes are graphs isometrically embeddable into hypercubes. Three infinite families and a few sporadic examples of cubic partial cubes are known. The concept of a tribe is introduced as means to systematize the known examples and establish relations among them. Efficient methods of computation of tribes are developed and several concrete tribes, that include known, as well as new cubic partial cubes, are computed by hand and with the use of a computer.
Keywords: mathematics, graph theory, partial cube, hypercube, isometric embedding, tribe, algorithm
Published in DKUM: 10.07.2015; Views: 1016; Downloads: 170
.pdf Full text (688,41 KB)
This document has many files! More...

5.
6.
7.
Embedding of complete and nearly complete binary trees into hypercubes
Aleksander Vesel, 2010

Abstract: A new simple algorithm for optimal embedding of complete binary trees into hypercubes as well as a node-by-node algorithm for embedding of nearly complete binary trees into hypercubes are presented.
Keywords: matematika, teorija grafov, vložitev, hiperkocka, algoritem, mathematics, graph theory, embedding, complete binary tree, hypercube, algorithm
Published in DKUM: 10.07.2015; Views: 1147; Downloads: 46
URL Link to full text

8.
Closed embeddings into Lipscomb's universal space
Ivan Ivanšić, Uroš Milutinović, 2006

Abstract: Naj bo ▫${mathcal{J}}(tau)$▫ Lipscombov enodimenzionalni prostor in ▫$L_n(tau) = {x in {mathcal{J}}(tau)^{n+1}|$▫ vsaj ena koordinata od ▫{sl x}▫ je iracionalna ▫$} subseteq {mathcal{J}}(tau)^{n+1}$▫ Lipscombov ▫$n$▫-dimenzionalni univerzalni prostor s težo ▫$tau ge aleph_0$▫. V tem članku dokazujemo, da če je ▫$X$▫ poln metrizabilni prostor in velja ▫$dim X le n$▫, ▫$wX le tau$▫, tedaj obstaja zaprta vložitev prostora ▫$X$▫ v ▫$L_n(tau)$▫. Še več, vsako zvezno funkcijo ▫$f: X to {mathcal{J}}(tau)^{n+1}$▫ lahko poljubno natančno aproksimiramo z zaprto vložitvijo ▫$psi: X to L_n(tau)$▫. Razen tega sta dokazani relativna verzija in punktirana verzija. V primeru separabilnosti je dokazan analogni rezultat, v katerem je klasična trikotna krivulja Sierpińskega (ki je homeomorfna ▫${mathcal{J}}(3)$▫) nadomestila ▫${mathcal{J}(aleph_0)}$▫.
Keywords: matematika, topologija, dimenzija pokrivanja, posplošena krivulja Sierpińskega, univerzalni prostor, Lipscombov univerzalni prostor, vložitev, razširitev, poln metrični prostor, zaprta vložitev, mathematics, topology, covering dimension, embedding, closed embedding, generalized Sierpiński curve, universal space, Lipscomb universal space, complete metric space, extension
Published in DKUM: 10.07.2015; Views: 1059; Downloads: 89
URL Link to full text

9.
Partial cubes are distance graphs
Melita Gorše Pihler, Janez Žerovnik, 2005

Abstract: Chatrand, Kubicki in Schultz [Aequationes Math. 55 (1998) 129-145] so postavili domnevo, da so vsi dvodelni grafi razdaljni grafi. V tem članku pokažemo, da so vsi grafi podmnožice dvodelnih grafov, in sicer delne kocke, razdaljni grafi.
Keywords: matematika, teorija grafov, razdaljni graf, delna kocka, hiperkocka, izometrični podgraf, vložitev, mathematics, graph theory, distance graph, partial cube, hypercube, isometric subgraph, embedding
Published in DKUM: 10.07.2015; Views: 1364; Downloads: 109
URL Link to full text

10.
The pointed version of Lipscomb's embedding theorem
Ivan Ivanšić, Uroš Milutinović, 2002

Abstract: Naj bo ▫$Sigma(tau)$▫ posplošena krivulja Sierpińskega. Le-ta se lahko na naraven način identificira z Lipscombovim prostorom ▫${cal J}(tau)$▫. Tedaj za poljuben ▫$n$▫-dimenzionalni metrični prostor ▫$X$▫ s težo ▫$tau$▫ obstaja vložitev prostora ▫$X$▫ v ▫$L_n(tau) subseteq Sigma(tau)^{n+1}$▫, kjer je ▫$L_n(tau)$▫ množica vseh točk z vsaj eno iracionalno koordinato. Tu dokažemo, da to vložitev lahko izberemo tako, da v določeni točki zavzema vnaprej podano vrednost. Pravzaprav je dokazan močnejši izrek, da so vrednosti vložitve lahko vnaprej podane v točkah poljubne končne množice.
Keywords: matematika, topologija, dimenzija pokrivanja, posplošena krivulja Sierpińskega, univerzalni prostor, Lipscombov univerzalni prostor, vložitev, razširitev, mathematics, topology, covering dimension, generalized Sierpiński curve, universal space, Lipscomb universal space, embedding, extension
Published in DKUM: 10.07.2015; Views: 1059; Downloads: 48
URL Link to full text

Search done in 1 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica