65 search results - page 6 / 13 » Regular Tree Language Recognition with Static Information |
NAACL
2004
13 years 8 months ago
2004
The regular occurrence of disfluencies is a distinguishing characteristic of spontaneous speech. Detecting and removing such disfluencies can substantially improve the usefulness ...
GECCO
2009
Springer
13 years 12 months ago
2009
Springer
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...
PPDP
2010
Springer
13 years 5 months ago
2010
Springer
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
NAACL
2010
13 years 5 months ago
2010
In this paper we propose a novel general framework for unsupervised model adaptation. Our method is based on entropy which has been used previously as a regularizer in semi-superv...
PARELEC
2002
IEEE
14 years 8 days ago
2002
IEEE
Many practical applications generate irregular, nonbalanced divide-and-conquer trees which have different depths, possibly also different numbers of successors at different levels...