25 search results - page 4 / 5 » The Complexity of Tree Transducer Output Languages |
ICASSP
2011
IEEE
13 years 8 days ago
2011
IEEE
The use of statically compiled search networks for ASR systems using huge vocabularies and complex language models often becomes challenging in terms of memory requirements. Dynam...
APLAS
2006
ACM
14 years 2 months ago
2006
ACM
XML transformations are most naturally defined as recursive functions on trees. Their direct implementation, however, causes inefficient memory usage because the input XML tree is...
POPL
2008
ACM
14 years 8 months ago
2008
ACM
A lens is a bidirectional program. When read from left to right, it denotes an ordinary function that maps inputs to outputs. When read from right to left, it denotes an "upd...
NAACL
2007
13 years 10 months ago
2007
We present a revision learning model for improving the accuracy of a dependency parser. The revision stage corrects the output of the base parser by means of revision rules learne...
FOCS
1998
IEEE
14 years 24 days ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...