Grant: Discovery Grants Program - Individual
Université de Montréal
$19,000.00
practical statistical machine translation
FY 2011-12
Summary
Currently, the dominant Statistical Machine Translation (SMT) paradigm capitalizes on pairs of sequences of words, namely phrases. Despite its success, phrase-based SMT has several well-understood shortcomings among which: no (or little) syntactical or semantic sensitivity, bad generalization capabilities, and a strong dependency on large parallel data. This severely limits in practice the deployment of SMT as a standalone technology. In this NSERC Research Program, I want to tackle these limitations by investigating three avenues.
In the first theme, I will investigate ways of building translation engines based on dependency n-grams: a head word (called governor) and the set of its dependents in a sentence, as identified by a dependency parser (DP) or a comparable device. DP-ns have several advantages over standard phrases including a better compromise between lexical expressiveness and generalization power.
The second theme of this research proposal is intended to solve part of a key challenge in the MT community: demonstrating that semantic information benefits SMT. As intuitive as this might appear, we have yet to demonstrate this empirically.
The third and last avenue pursued in this proposal is the one of alleviating the strong dependency current SMT technology has on the availability of parallel training material. Parallel corpus enrichment as well as improved parallel data mining will be investigated.
Program
Discovery Grants Program - Individual
Recipient
Location
Quebec, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
249630-2007
Name nom
Langlais, Philippe
Department département
Informatique et recherche opérationnelle
Organization id
63
Institution établissement
Université de Montréal
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2011
Competition year année de concours
2007
Award amount
19000
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
802
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Information systems and technology
Area of application fr
Systèmes d'information et technologie de l'information
Research subject code
2801
Research subject group en
Artificial intelligence
Research subject group fr
Intelligence artificielle
Research subject en
Natural language and speech understanding
Research subject fr
Langage naturel et reconnaissance de la parole
Partie
5
Nb partie
5
Application title
practical statistical machine translation
Keyword
NSERC
Application summary
Currently, the dominant Statistical Machine Translation (SMT) paradigm capitalizes on pairs of sequences of words, namely phrases. Despite its success, phrase-based SMT has several well-understood shortcomings among which: no (or little) syntactical or semantic sensitivity, bad generalization capabilities, and a strong dependency on large parallel data. This severely limits in practice the deployment of SMT as a standalone technology. In this NSERC Research Program, I want to tackle these limitations by investigating three avenues.
In the first theme, I will investigate ways of building translation engines based on dependency n-grams: a head word (called governor) and the set of its dependents in a sentence, as identified by a dependency parser (DP) or a comparable device. DP-ns have several advantages over standard phrases including a better compromise between lexical expressiveness and generalization power.
The second theme of this research proposal is intended to solve part of a key challenge in the MT community: demonstrating that semantic information benefits SMT. As intuitive as this might appear, we have yet to demonstrate this empirically.
The third and last avenue pursued in this proposal is the one of alleviating the strong dependency current SMT technology has on the availability of parallel training material. Parallel corpus enrichment as well as improved parallel data mining will be investigated.