Anh-Cuong Le

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 Phuong-Thai Nguyen

> Home > Persons > Anh-Cuong Le

Publications

2015
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/lre/NguyenLHN15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/lre/NguyenLHN15
Phuong-Thai Nguyen, Anh-Cuong Le, Tu-Bao Ho, Van Hiep Nguyen:
Vietnamese treebank construction and entropy-based error detection. Lang. Resour. Evaluation 49(3): 487-519 (2015)
2014
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/fuin/HoangLNPH14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fuin/HoangLNPH14
Cuong Hoang, Anh-Cuong Le, Phuong-Thai Nguyen, Son Bao Pham, Tu-Bao Ho:
An Efficient Framework for Extracting Parallel Sentences from Non-Parallel Corpora. Fundam. Informaticae 130(2): 179-199 (2014)
2012
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/rivf/HoangLNH12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/rivf/HoangLNH12
Cuong Hoang, Anh-Cuong Le, Phuong-Thai Nguyen, Tu-Bao Ho:
Exploiting Non-Parallel Corpora for Statistical Machine Translation. RIVF 2012: 1-6
2011
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/kse/NguyenLHD11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/kse/NguyenLHD11
Phuong-Thai Nguyen, Anh-Cuong Le, Tu-Bao Ho, Thi-Thanh-Tam Do:
Two Entropy-Based Methods for Detecting Errors in POS-Tagged Treebank. KSE 2011: 150-156

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.