Sciweavers

2713 search results - page 277 / 543
» Parameterized Tree Systems
Sort
View
TACS
1994
Springer
15 years 10 months ago
Syntactic Definitions of Undefined: On Defining the Undefined
In the A-calculus, there is a standard notion of what terms should be considered to be "undefined": the unsolvable terms. There are various equivalent characterisations o...
Zena M. Ariola, Richard Kennaway, Jan Willem Klop,...
ACL
2006
15 years 8 months ago
Polarized Unification Grammars
This paper proposes a generic mathematical formalism for the combination of various structures: strings, trees, dags, graphs and products of them. The polarization of the objects ...
Sylvain Kahane
128
Voted
ACL
2001
15 years 8 months ago
Automated Parser Construction from a Treebank by means of TBL and ILP
Considering the difficulties inherent in the manual construction of natural language parsers, we have designed and implemented our system GRIND which is capable of learning a sequ...
Miloslav Nepil
MT
2007
120views more  MT 2007»
15 years 6 months ago
Capturing practical natural language transformations
We study automata for capturing the transformations in practical natural language processing systems, especially those that translate between human languages. For several variation...
Kevin Knight
CVPR
2006
IEEE
16 years 8 months ago
Probabilistic 3D Polyp Detection in CT Images: The Role of Sample Alignment
Automatic polyp detection is an increasingly important task in medical imaging with virtual colonoscopy [15] being widely used. In this paper, we present a 3D object detection alg...
Zhuowen Tu, Xiang Sean Zhou, Luca Bogoni, Adrian B...