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
9
click to vote
COLING
2008
favorite
Email
discuss
report
99
views
Computational Linguistics
»
more
COLING 2008
»
On the Weak Generative Capacity of Weighted Context-free Grammars
13 years 10 months ago
Download
www.aclweb.org
It is shown how weighted context-free grammars can be used to recognize languages beyond their weak generative capacity by a one-step constant time extension of standard recognition algorithms.
Anders Søgaard
Real-time Traffic
COLING 2008
|
Computational Linguistics
|
One-step Constant Time
|
Weak Generative Capacity
|
Weighted Context-free Grammars
|
claim paper
Related Content
»
Generalized Multitext Grammars
»
The Pumping Lemma for WellNested Multiple ContextFree Languages
»
Comparing the Use of Feature Structures in Nativism and in Database Semantics
»
Tile Rewriting Grammars
»
Concepttotext Generation via Discriminative Reranking
»
The Importance of Rule Restrictions in CCG
»
MonteCarlo Sampling for NPHard Maximization Problems in the Framework of Weighted Parsing
»
Structural Disambiguation with Constraint Propagation
more »
Post Info
More Details (n/a)
Added
29 Oct 2010
Updated
29 Oct 2010
Type
Conference
Year
2008
Where
COLING
Authors
Anders Søgaard
Comments
(0)
Researcher Info
Computational Linguistics Study Group
Computer Vision