Sciweavers

279 search results - page 24 / 56
» Tree Pattern Rewriting Systems
Sort
View
ICDT
2010
ACM
147views Database» more  ICDT 2010»
13 years 11 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
ICASSP
2008
IEEE
14 years 2 months ago
Effective error prediction using decision tree for ASR grammar network in call system
CALL (Computer Assisted Language Learning) systems using ASR (Automatic Speech Recognition) for second language learning have received increasing interest recently. However, it st...
Hongcui Wang, Tatsuya Kawahara
WWW
2001
ACM
14 years 9 months ago
IEPAD: information extraction based on pattern discovery
The research in information extraction (IE) regards the generation of wrappers that can extract particular information from semistructured Web documents. Similar to compiler gener...
Chia-Hui Chang, Shao-Chen Lui
FOSSACS
2003
Springer
14 years 1 months ago
Manipulating Trees with Hidden Labels
We define an operational semantics and a type system for manipulating semistructured data that contains hidden information. The data model is simple labeled trees with a hiding op...
Luca Cardelli, Philippa Gardner, Giorgio Ghelli
AUSAI
2003
Springer
14 years 1 months ago
Reduction of Non Deterministic Automata for Hidden Markov Model Based Pattern Recognition Applications
Most on-line cursive handwriting recognition systems use a lexical constraint to help improve the recognition performance. Traditionally, the vocabulary lexicon is stored in a trie...
Frédéric Maire, Frank Wathne, Alain ...