Gonzalo Iglesias
Biographic Data
| ID | 6536629 |
|---|---|
| NAME | Gonzalo Iglesias |
| GIVEN NAMES | Gonzalo |
| FAMILY NAME | Iglesias |
| SIGNATURE | IGLESIAS G |
| AFFILIATIONS | University of Cambridge |
| VERIFIED | No |
| TOTAL WORKS | 2 |
| TOTAL CITATIONS | 0 |
| WORKS AS AUTHOR | 2 |
| WORKS AS EDITOR | 0 |
| FIRST PUBLICATION YEAR | 2010 |
| LATEST PUBLICATION YEAR | 2014 |
| H-INDEX | 0 |
Pushdown Automata in Statistical Machine Translation
This article describes the use of pushdown automata (PDA) in the context of statistical machine translation and alignment under a synchronous context-free grammar. We use PDAs to compactly represent the space of candidate translations generated by the grammar when applied to an input sentence. General-purpose PDA algorithms for replacement, composition, shortest path, and expansion are presented. We describe HiPDT, a hierarchical phrase-based dec…
Hierarchical Phrase-Based Translation with Weighted Finite-State Transducers and Shallow- n Grammars
In this article we describe HiFST, a lattice-based decoder for hierarchical phrase-based translation and alignment. The decoder is implemented with standard Weighted Finite-State Transducer (WFST) operations as an alternative to the well-known cube pruning procedure. We find that the use of WFSTs rather than k-best lists requires less pruning in translation search, resulting in fewer search errors, better parameter optimization, and improved tran…
No prominent works on this page.
Hierarchical Phrase-Based Translation with Weighted Finite-State Transducers and Shallow- n Grammars
In this article we describe HiFST, a lattice-based decoder for hierarchical phrase-based translation and alignment. The decoder is implemented with standard Weighted Finite-State Transducer (WFST) operations as an alternative to the well-known cube pruning procedure. We find that the use of WFSTs rather than k-best lists requires less pruning in translation search, resulting in fewer search errors, better parameter optimization, and improved tran…
Pushdown Automata in Statistical Machine Translation
This article describes the use of pushdown automata (PDA) in the context of statistical machine translation and alignment under a synchronous context-free grammar. We use PDAs to compactly represent the space of candidate translations generated by the grammar when applied to an input sentence. General-purpose PDA algorithms for replacement, composition, shortest path, and expansion are presented. We describe HiPDT, a hierarchical phrase-based dec…
Algorithm (2 works) · Artificial Intelligence (2 works) · Computer Science (2 works) · Example-based machine translation (2 works) · Machine translation (2 works) · Natural language processing (2 works) · Natural Language Processing Techniques (2 works) · Rule-based machine translation (2 works) · Synchronous context-free grammar (2 works) · Topic Modeling (2 works)