Sciweavers

643 search results - page 4 / 129
» Parsing And Derivational Equivalence
Sort
View
EMNLP
2009
13 years 5 months ago
Better Synchronous Binarization for Machine Translation
Binarization of Synchronous Context Free Grammars (SCFG) is essential for achieving polynomial time complexity of decoding for SCFG parsing based machine translation systems. In t...
Tong Xiao, Mu Li, Dongdong Zhang, Jingbo Zhu, Ming...
ACL
2007
13 years 9 months ago
Pipeline Iteration
This paper presents pipeline iteration, an approach that uses output from later stages of a pipeline to constrain earlier stages of the same pipeline. We demonstrate significant ...
Kristy Hollingshead, Brian Roark
EACL
1993
ACL Anthology
13 years 8 months ago
The Use of Shared Forests in Tree Adjoining Grammar Parsing
We study parsing of tree adjoining grammars with particular emphasis on the use of shared forests to represent all the parse trees deriving a well-formed string. We show that ther...
K. Vijay-Shanker
ICSM
2003
IEEE
14 years 22 days ago
Deriving tolerant grammars from a base-line grammar
A grammar-based approach to tool development in re- and reverse engineering promises precise structure awareness, but it is problematic in two respects. Firstly, it is a considera...
Steven Klusener, Ralf Lämmel
APSEC
1998
IEEE
13 years 11 months ago
An Automatic Test Case Generator Derived from State-Based Testing
This paper describes an automated approach to generating test cases for an object-oriented class. The approach is derived from state-based testing methods and refers to a state ma...
Bor-Yuan Tsai, Simon Stobart, Norman Parrington, I...