E. Ristad, The Language Complexity Game, MIT Press, Cambridge, MA, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Realistic Parsing: Practical Solutions of Difficult Problems - Delisle, Szpakowicz (1995) (Correct)
....et al. 1993; Chinchor et al. 1993) Full parsing tends to be too time consuming for certain types of actual, unsimplified data. This observation comes as no surprise, because it has recently become more clearly established and accepted that natural language is NP complete (for example, see Ristad s complexity thesis (1993)) In DIPETT, fragmentary parsing in combination with the time out mechanism (see 2.2) is essentially a lastresort parsing strategy. The rationale is this: if a complete analysis cannot be found for a given input (due to a time up or extra grammaticality of the input) a fragmentary ....
E. S. Ristad, The Language Complexity Game, The MIT Press, 1993.
Interleaving Natural Language Parsing and Generation Through.. - Neumann (1998) (3 citations) (Correct)
.... it for performing both tasks seems to be quite plausible, and there are many arguments based on practical and psychological considerations for adopting such a view (e.g. Frazier, 1982; Kempen and Hoenkamp, 1987; Jacobs, 1988; Shieber, 1988; Appelt, 1987; Alshawi and Crouch, 1992; VanNoord, 1993; Ristad, 1993 ] Recent developments in constraintbased grammar theories due to their declarative and formal status demonstrate that grammar reversibility is computationally feasible. Nevertheless, in almost all large natural language systems in which parsing and generation are considered in similar ....
E. S. Ristad. The Language Complexity Game. MIT-Press, 1993.
Learning Natural Language: A review of formal and computational.. - Chang (Correct)
....circumstances provides for better than exponential learning. Intractability may be unavoidable; some recent attempts to analyze natural language tasks from a representation (and theory ) independent viewpoint suggests that at least one task in natural language recognition task is NP complete (Ristad 1993). 1 This may not be surprising, given the hardness results for learning CFGs and the assumption that natural languages are at least that hard. In addition to computational intractability, enumerative learning strategies lack any semblance of psychological plausibility. This apparently bleak ....
Ristad, Eric Sven. 1993. The Language Complexity Game. MIT Press.
Interleaving Natural Language Parsing and Generation Through.. - Neumann (1998) (3 citations) (Correct)
.... it for performing both tasks seems to be quite plausible, and there are many arguments based on practical and psychological considerations for adopting such a view (e.g. Frazier, 1982; Kempen and Hoenkamp, 1987; Jacobs, 1988; Shieber, 1988; Appelt, 1987; Alshawi and Crouch, 1992; VanNoord, 1993; Ristad, 1993 ] Recent developments in the area of constraint based grammar theories due to their declarative and formal status demonstrate that grammar reversibility is in fact computationally feasible. Nevertheless, in almost all large natural language systems in which parsing and generation are ....
E. S. Ristad. The Language Complexity Game. MIT-Press, 1993.
The Role of Parameterized Computational Complexity Theory in.. - Wareham (1996) (Correct)
....Declarative Phonology and Optimality Theory. Introduction Over the last fifteen years, a number of authors have applied computational complexity theory (CCT) to evaluate models of cognitive systems, e.g. vision, natural language, memory (Berwick Weinberg 1984; Barton, Berwick, Ristad 1987; Ristad 1993; Tsotsos 1990; 1993; Valiant 1994) In part because of various assumptions underlying CCT, critics have questioned the relevance of such analyses (Ramer 1995; Rounds 1991) Recent work (Downey et al. 1994) suggests that certain of these criticisms can be addressed by using the theory of ....
....real organisms. However, in light of known bounds on brain structure and processing capacity (Tsotsos 1990; 1993) equally valuable insights can be derived via complexity theoretic hardness results which show what cannot be done over a wide range of machines and input sizes. Indeed, as argued in (Ristad 1993; Tsotsos 1990) both algorithmic upper bound and hardness lower bound results are necessary to delineate what types of models of cognitive systems are tractable relative to known biological limitations, and hence may be implemented in real organisms. The following synthesis of Ristad s language ....
[Article contains additional citation context not shown here]
Ristad, E. S. 1993. The Language Complexity Game.
The Parameterized Complexity of Some Problems in.. - Downey, Fellows.. (2002) (6 citations) (Correct)
No context found.
E. Ristad, The Language Complexity Game, MIT Press, Cambridge, MA, 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC