65 search results - page 2 / 13 » Regular Tree Language Recognition with Static Information |
ICASSP
2009
IEEE
13 years 9 months ago
2009
IEEE
Speech recognition of inflectional and morphologically rich languages like Czech is currently quite a challenging task, because simple n-gram techniques are unable to capture impo...
PLANX
2007
13 years 6 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
NIPS
2004
13 years 6 months ago
2004
In this paper, we explore the use of Random Forests (RFs) in the structured language model (SLM), which uses rich syntactic information in predicting the next word based on words ...
KES
2008
Springer
13 years 5 months ago
2008
Springer
This paper presents ontology-based architecture for pattern recognition in the context of static source code analysis. The proposed system has three subsystems: parser, OWL ontolog...
CC
2007
Springer
13 years 11 months ago
2007
Springer
As the amount of data used by programs increases due to the growth of hardware storage capacity and computing power, efficient memory usage becomes a key factor for performance. Si...