Sciweavers

4095 search results - page 294 / 819
» How to test a tree
Sort
View
ARVLSI
1995
IEEE
146views VLSI» more  ARVLSI 1995»
15 years 4 months ago
Array-of-arrays architecture for parallel floating point multiplication
This paper presents a new architecture style for the design of a parallel floating point multiplier. The proposed architecture is a synergy of trees and arrays. Architectural mod...
H. Dhanesha, K. Falakshahi, Mark Horowitz
ADBIS
2008
Springer
117views Database» more  ADBIS 2008»
15 years 2 months ago
Reclassification of Linearly Classified Data Using Constraint Databases
In many problems the raw data is already classified according to a variety of features using some linear classification algorithm but needs to be reclassified. We introduce a novel...
Peter Z. Revesz, Thomas Triplet
104
Voted
ACL
2007
15 years 2 months ago
Forest-to-String Statistical Translation Rules
In this paper, we propose forest-to-string rules to enhance the expressive power of tree-to-string translation models. A forestto-string rule is capable of capturing nonsyntactic ...
Yang Liu, Yun Huang, Qun Liu, Shouxun Lin
85
Voted
EMNLP
2007
15 years 2 months ago
Treebank Annotation Schemes and Parser Evaluation for German
Recent studies focussed on the question whether less-configurational languages like German are harder to parse than English, or whether the lower parsing scores are an artefact o...
Ines Rehbein, Josef van Genabith
ACL
2006
15 years 2 months ago
A Fast, Accurate Deterministic Parser for Chinese
We present a novel classifier-based deterministic parser for Chinese constituency parsing. Our parser computes parse trees from bottom up in one pass, and uses classifiers to make...
Mengqiu Wang, Kenji Sagae, Teruko Mitamura