2475 search results - page 232 / 495 » On the accuracy of language trees |
209
click to vote
DLT
2003
15 years 8 months ago
2003
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
169
click to vote
HASKELL
2008
ACM
15 years 7 months ago
2008
ACM
The “zipper” is a well known design pattern for providing a cursorlike interface to a data structure. However, the classic treatise by Huet only scratches the surface of some ...
185
click to vote
TCS
2010
15 years 1 months ago
2010
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
183
click to vote
ICASSP
2011
IEEE
14 years 10 months 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...
127
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
As part of the Language Observatory Project [4], we have been crawling all the web space since 2004. We have collected terabytes of data mostly from Asian and African ccTLDs. In t...