Sciweavers

675 search results - page 65 / 135
» On Compression of Parse Trees
Sort
View
ACL
1998
13 years 10 months ago
Using Decision Trees to Construct a Practical Parser
This paper describes novel and practical Japanese parsers that uses decision trees. First, we construct a single decision tree to estimate modification probabilities; how one phra...
Masahiko Haruno, Satoshi Shirai, Yoshifumi Ooyama
ICCPOL
2009
Springer
14 years 3 months ago
Lexicalized Syntactic Reordering Framework for Word Alignment and Machine Translation
Abstract. We propose a lexicalized syntactic reordering framework for crosslanguage word aligning and translating researches. In this framework, we first flatten hierarchical sourc...
Chung-Chi Huang, Wei-Teh Chen, Jason S. Chang
ICCAD
1999
IEEE
120views Hardware» more  ICCAD 1999»
14 years 1 months ago
Regularity extraction via clan-based structural circuit decomposition
Identifying repeating structural regularities in circuits allows the minimization of synthesis, optimization, and layout e orts. We introduce in this paper a novel method for ident...
Soha Hassoun, Carolyn McCreary
PPSN
1994
Springer
14 years 26 days ago
A Representation Scheme To Perform Program Induction in a Canonical Genetic Algorithm
This paper studies Genetic Programming (GP) and its relation to the Genetic Algorithm (GA). GP uses a GA approach to breed successive populations of programs, represented in the ch...
Mark Wineberg, Franz Oppacher
AIIA
1995
Springer
14 years 10 days ago
Learning Programs in Different Paradigms using Genetic Programming
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to par...
Man Leung Wong, Kwong-Sak Leung