Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
2
click to vote
COLING
1990
favorite
Email
discuss
report
76
views
Computational Linguistics
»
more
COLING 1990
»
The Complexity Of Parsing With Extended Categorial Grammars
13 years 5 months ago
Download
acl.ldc.upenn.edu
Esther König
Real-time Traffic
COLING 1990
|
COLING 2008
|
claim paper
Related Content
»
A CKY parser for picture grammars
»
Polynomial Time Parsing of Combinatory Categorial Grammars
»
Structural disambiguation of morphosyntactic categorial parsing for Korean
»
Recursive descent parsing for Boolean grammars
»
A Syntactified Direct Translation Model with Lineartime Decoding
»
The Structure of Shared Forests in Ambiguous Parsing
»
Error Tolerant Document Structure Analysis
»
Computational Complexity of Probabilistic Disambiguation by means of TreeGrammars
»
Packrat parsers can handle practical grammars in mostly constant space
more »
Post Info
More Details (n/a)
Added
07 Nov 2010
Updated
07 Nov 2010
Type
Conference
Year
1990
Where
COLING
Authors
Esther König
Comments
(0)
Researcher Info
Computational Linguistics Study Group
Computer Vision