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
35
click to vote
ACL
1989
favorite
Email
discuss
report
69
views
Computational Linguistics
»
more
ACL 1989
»
How to Cover a Grammar
14 years 1 months ago
Download
www.aclweb.org
A novel formalism is presented for Earley-like parsers. It accommodates the simulation of non-deterministic pushdown automata. In particular, the theory is applied to non-deterministlc LRoparsers for RTN grammars.
René Leermakers
Real-time Traffic
ACL 1989
|
ACL 2007
|
Earley-like Parsers
|
Non-deterministic Pushdown Automata
|
RTN Grammars
|
claim paper
Post Info
More Details (n/a)
Added
06 Nov 2010
Updated
06 Nov 2010
Type
Conference
Year
1989
Where
ACL
Authors
René Leermakers
Comments
(0)
Researcher Info
Computational Linguistics Study Group
Computer Vision