Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Alexandru Ceausu

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Sabine Hunsicker

> Home > Persons > Alexandru Ceausu

Publications

2019
[p1]
- view
  authority control:
- export record
  dblp key:
  - series/tanlp/AkerCFGHIIST19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/series/tanlp/AkerCFGHIIST19
Ahmet Aker, Alexandru Ceausu, Yang Feng, Robert J. Gaizauskas, Sabine Hunsicker, Radu Ion, Elena Irimia, Dan Stefanescu, Dan Tufis:
Mapping and Aligning Units from Comparable Corpora. Using Comparable Corpora for Under-Resourced Areas of Machine Translation 2019: 141-188
2016
[c20]
- view
  - electronic edition @ aclanthology.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/eamt/CeausuHD16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eamt/CeausuHD16
Alexandru Ceausu, Sabine Hunsicker, Tudy Droumaguet:
Amplexor MTExpert - machine translation adapted to the translation workflow. EAMT (Projects/Products) 2016
2014
[c19]
- view
  - electronic edition @ lrec-conf.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/lrec/CeausuH14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lrec/CeausuH14
Alexandru Ceausu, Sabine Hunsicker:
Pre-ordering of phrase-based machine translation input in translation workflow. LREC 2014: 3589-3592

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.