8 search results - page 1 / 2 » Factoring Synchronous Grammars by Sorting |
ACL
2006
14 years 7 days ago
2006
Synchronous Context-Free Grammars (SCFGs) have been successfully exploited as translation models in machine translation applications. When parsing with an SCFG, computational comp...
IPPS
1997
IEEE
14 years 3 months ago
1997
IEEE
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
ATVA
2010
Springer
13 years 9 months ago
2010
Springer
: Narrowing the wide conceptual gap between problem and implementation domains is considered a significant factor within software engineering. Currently, such a relation is often o...
EMNLP
2010
13 years 8 months ago
2010
Conventional wisdom dictates that synchronous context-free grammars (SCFGs) must be converted to Chomsky Normal Form (CNF) to ensure cubic time decoding. For arbitrary SCFGs, this...
COLING
1990
14 years 10 hour ago
1990
Lexicalized Tree Adjoining Grammar (LTAG) is an attractive formalism for linguistic description mainly because cff its extended domain of locality and its factoring recursion out ...