Search Sciweavers | Sciweavers

Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...

Lokendra Shastri

claim paper

Read More »

137

click to vote

AAAI
1992

102views Intelligent Agents» more AAAI 1992»

An On-Line Computational Model of Human Sentence Interpretation

15 years 7 months ago

Download www.eecs.berkeley.edu

Daniel Jurafsky

claim paper

Read More »

111

click to vote

COLING
1992

85views Computational Linguistics» more COLING 1992»

A Computational Model Of Language Performance: Data Oriented Parsing

15 years 7 months ago

Download acl.ldc.upenn.edu

Rens Bod

claim paper

Read More »

112

click to vote

COLING
1990

80views Computational Linguistics» more COLING 1990»

A Computational Model for Arguments Understanding

15 years 7 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers