Name
Abstract | ||
|---|---|---|
Stochastic Inversion Transduction Grammars constitute a powerful formalism in Machine Translation for which an efficient Dynamic Programming parsing algorithm exists. In this work, we review this parsing algorithm and propose important modifications that enlarge the search space. These modifications allow the parsing algorithm to search for more and better solutions. |
Year | Venue | Keywords |
|---|---|---|
2010 | North American Chapter of the Association for Computational Linguistics | machine translation,sitg parsing,stochastic inversion transduction grammars,parsing algorithm,search space,powerful formalism,better solution,enlarged search space,important modification,efficient dynamic programming |
Field | DocType | ISBN |
Computer science,Machine translation,Theoretical computer science,Artificial intelligence,Natural language processing,Top-down parsing,L-attributed grammar,Algorithm,Bottom-up parsing,Parsing expression grammar,Parser combinator,Parsing,Memoization,Machine learning | Conference | 1-932432-65-5 |
Citations | PageRank | References |
1 | 0.37 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guillem Gascó I Mora | 1 | 9 | 0.88 |
| Joan-Andreu Sánchez | 2 | 198 | 29.00 |
| José-Miguel Benedí | 3 | 318 | 29.43 |