Sciweavers

26 search results - page 5 / 6
» Strong Lexicalization of Tree Adjoining Grammars
Sort
View
ACL
2007
13 years 7 months ago
Supertagged Phrase-Based Statistical Machine Translation
Until quite recently, extending Phrase-based Statistical Machine Translation (PBSMT) with syntactic structure caused system performance to deteriorate. In this work we show that i...
Hany Hassan, Khalil Sima'an, Andy Way
COLING
1996
13 years 6 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
LRE
2008
100views more  LRE 2008»
13 years 5 months ago
LTAG-spinal and the Treebank
Abstract. We introduce LTAG-spinal, a novel variant of traditional Lexicalized Tree Adjoining Grammar (LTAG) with desirable linguistic, computational and statistical properties. Un...
Libin Shen, Lucas Champollion, Aravind K. Joshi
TASLP
2008
201views more  TASLP 2008»
13 years 5 months ago
Syntactically Lexicalized Phrase-Based SMT
Abstract--Until quite recently, extending Phrase-based Statistical Machine Translation (PBSMT) with syntactic knowledge caused system performance to deteriorate. The most recent su...
Hany Hassan, Khalil Sima'an, Andy Way
NLP
2000
13 years 9 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman