Sciweavers

2475 search results - page 220 / 495
» On the accuracy of language trees
Sort
View
COGSCI
2004
82views more  COGSCI 2004»
15 years 6 months ago
Restricting grammatical complexity
of natural language syntax often characterize grammatical knowledge as a form of abstract computation. This paper argues that such a characterization is correct, and that fundamen...
Robert Frank
LPAR
2012
Springer
14 years 2 months ago
Querying Proofs
We motivate and introduce a query language PrQL designed for inspecting machine representations of proofs. PrQL natively supports hiproofs which express proof structure using hiera...
David Aspinall, Ewen Denney, Christoph Lüth
CCL
1994
Springer
15 years 10 months ago
How to Win a Game with Features
We employ the model-theoretic method of Ehrenfeucht-Fra sse Games to prove the completeness of the theory CFT, which has been introduced in 22] for describing rational trees in a ...
Rolf Backofen, Ralf Treinen
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 6 months ago
Maximum Entropy Rate of Markov Sources for Systems With Non-regular Constraints
Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained sy...
Georg Böcherer, Valdemar Cardoso da Rocha Jr....
WWW
2006
ACM
16 years 7 months ago
Towards practical genre classification of web documents
Classification of documents by genre is typically done either using linguistic analysis or term frequency based techniques. The former provides better classification accuracy than...
George Ferizis, Peter Bailey