1 / 13

Non-contiguity phrase-based SMT

Non-contiguity phrase-based SMT. Hendra Setiawan. Outline. A brief introduction to SMT Non-contiguity for SMT Near-future work. SMT P ( e | f ). Introduction to SMT. f: damoy Pat Riley rano pashol. e: Pat Riley went home early. Alignment describes translation.

toan
Download Presentation

Non-contiguity phrase-based SMT

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Non-contiguity phrase-based SMT Hendra Setiawan

  2. Outline • A brief introduction to SMT • Non-contiguity for SMT • Near-future work

  3. SMT P(e|f) Introduction to SMT f: damoy Pat Riley rano pashol e: Pat Riley went home early Alignment describes translation

  4. damoy Pat Riley rano pashol home Pat Riley early went damoy Pat Riley rano pashol Pat Riley went home early Introduction to SMT • Translation process: • Lexical mapping • Reordering (at word level) (at word level)

  5. Introduction to SMT • Translation process: (state-of-the-art) • Lexical mapping (at phrase level) • Reordering (at phrase level) damoy Pat_Riley rano pashol home Pat_Riley early went damoy Pat_Riley rano pashol Pat_Riley went home early

  6. Outline • A brief introduction to SMT • Non-contiguity for SMT • Near-future work

  7. Contiguity to Non-contiguity (1) • Lexical mapping (training): • Can translate “Pat_Riley” to “Pat_Riley” but not “not” to “ne… pas” • Impose contiguity constraint when extracting “Pat_Riley”. • Given automatic alignment: only 40% coverage (max windows length = 7) e1e2…………...el fm ... .……… f2f1

  8. Contiguity to Non-contiguity (2) • Relax the contiguity constraint • Increase coverage from 40% to 53% e1e2…………...el fm ... .……… f2f1

  9. No-ordering (monotone) Unconstrained (permutation) Local-ordering ITG (80%) SpG (95%) e1/f1 em/fm e1/f1 em/fm Contiguity to Non-contiguity (3) • Reordering

  10. Gap : PLMMG(e|f) x PLMMG(f|e)x PJSCM([e,f]f) x Plm(e)xPfe(o,g|[e,f]f)xPef(o,g|[e,f]e) Pharaoh Gap english point-of-view english point-of-view PLMMG(e|f), Plm(e), Pef(o,g|[e,f]e) PLMM(e|f), Plm(e), PD(e|f) foreign point-of-view foreign point-of-view PLMM(f|e) PLMMG(f|e),Pjscm([e,f]f), Pfe(o,g|[e,f]f) Model Comparison Pharaoh : PLMM(e|f) x PLMM(f|e) x Plm(e) x PD(e|f) Lexical Mapping Reordering

  11. Some close testing result BLEU Model combination

  12. Outline • A brief introduction to SMT • Non-contiguity for SMT • Near-future work

  13. Near-future work • Parameter estimation and backoff strategy for bigram model • Perform open testing and analyze the result

More Related