• Corpus ID: 17356436

The language complexity game

@inproceedings{Ristad1993TheLC,
  title={The language complexity game},
  author={Eric Sven Ristad},
  year={1993}
}
From the Publisher: "How can language be both complex and subtle, yet simple and effortless? Eric Ristad's book tackles this deepest of questions with all the power and precision of modern computer science, coming up with the best analysis of human language complexity since Chomsky's famous demonstrations that natural languages cannot be described via simple linear patterns." -- Robert C. Berwick, MIT "Eric Ristad's carefully reasoned and penetrating study brings together the theories of… 
Learning Natural Language : A review of formal and computational approachesNancy
TLDR
Early theoretical work on identiication of formal languages in general is reviewed before subsequent work in which speciic linguistic assumptions render the problem more tractable is described.
Cognition and intractability: a guide to classical and parameterized complexity analysis
TLDR
Cognition and Intractability is the first book to provide an accessible introduction to computational complexity analysis and its application to questions of intractability in cognitive science.
The Parameterized Complexity of Some Problems in Logic and Linguistics
TLDR
The theory of parameterized computational complexity introduced in [DF1-3] appears to be of wide applicability in the study of the complexity of concrete problems and of some problems concerning phonological derivation in linguistic theory.
Exploring the N-th Dimension of Language
TLDR
This paper is aimed at exploring the hidden fundamental computational property of natural language that has been so elusive that it has made all attempts to characterize its real computational property ultimately fail and it is proposed that this exact computational property is perhaps the N-th dimension of language, if what the authors mean by dimension is nothing but universal (computational) property ofnatural language.
Computational complexity of polyadic lifts of generalized quantifiers in natural language
TLDR
It is shown that the standard constructions that turn simple determiners into complex quantifiers, namely Boolean operations, iteration, cumulation, and resumption, are tractable and an insight into branching operation yielding intractable natural language multi-quantifier expressions is provided.
Computational Perspectives on Minimalism
While research in ‘principles and parameters’ tradition [18] can be regarded as attributing as much as possible to universal grammar (UG) in order to understand how language acquisition is possible,
Logic and Complexity in Cognitive Science
TLDR
It is argued that the computational perspective allows feedback from empirical results to guide the development of increasingly subtle computational models, and the role played by logic in bridging the gaps between Marr’s three levels is emphasized.
Descriptive Complexity, Computational Tractability, and the Logical and Cognitive Foundations of Mathematics
  • M. Pantsar
  • Computer Science, Philosophy
    Minds Mach.
  • 2021
TLDR
This paper argues that the problem of second-order systems of logic being considered to be computationally intractable means that the logical foundation of mathematics can be prohibitively complex for human cognition and can be solved by considering computational complexity for humanly relevant problem solving algorithms and input sizes.
Conceptual and empirical problems with game theoretic approaches to language evolution
TLDR
Game theoretic models of language evolution have failed to advance how or why language evolved, or why it has the particular representations and computations that it does, and are argued to be problematic due to conceptual confusions and empirical difficiences.
Easy Solutions for a Hard Problem? The Computational Complexity of Reciprocals with Quantificational Antecedents
TLDR
The results from the picture completion experiment suggest that intractable readings occur in language comprehension and it is argued that during verification, guessing strategies are used to reduce computational complexity.
...
...

References

SHOWING 1-10 OF 20 REFERENCES
Mathematical Methods in Linguistics
1. All other texts on the mathematics of language are now obsolete. Therefore, instead of going on about what a wonderful job Partee, ter Meulen, and Wall (henceforth, PMW) have done in some ways
Knowledge of language: its nature, origin, and use
Why do we know so much more than we have evidence for in certain areas, and so much less in others? In tackling these questions--Plato's and Orwell's problem--Chomsky again demonstrates his
Natural Language Processing: The PLNLP Approach
TLDR
The reader is presented with the theory and application of a working, real-world, domain-free NLP system, and attempts to bridge the gap between computational and theoretical models of linguistic structure.
Computational structure of human language
TLDR
The first restriction on elementary rules is to limit the class of arbitrary rewritings to the interface between phonology and morphology, and to ban the arbitrary rewriting of segmental strings from the phonology proper.
Towards Transductive Linguistics
TLDR
The theory of transducers corresponds better to linguistic reality, and especially to the practice of computational linguistics, than does the earlier theory of generative grammars.
Capacity, complexity, and beyond
  • /2). (Mathematics of Language
  • 1993
Review of Barbara H. Partee
  • Computational Linguistics
  • 1990
" How many " possible human languages are there ?
  • Linguistic Inquiry
  • 1983
...
...