Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

76

COLING
1992

favoriteEmaildiscussreport

132views Computational Linguistics» more COLING 1992»

Probabilistic Tree-Adjoining Grammar As A Framework For Statistical Natural Language Processing

15 years 3 days ago

Probabilistic Tree-Adjoining Grammar As A Framework For Statistical Natural Language Processing

Download acl.ldc.upenn.edu

Philip Resnik

Real-time Traffic

COLING 1992 | COLING 2008 |

claim paper

Related Content

» Unifying Synchronous Tree Adjoining Grammars and Tree Transducers via Bimorphisms

» The Use of Shared Forests in Tree Adjoining Grammar Parsing

» Synchronous Tree Adjoining Machine Translation

» Computational Complexity of Probabilistic Disambiguation by means of TreeGrammars

» Expressive Power and Consistency Properties of StateoftheArt Natural Language Parsers

» MonteCarlo Sampling for NPHard Maximization Problems in the Framework of Weighted Parsing

» Natural Language Understanding by Combining Statistical Methods and Extended ContextFree G...

» Generating Statistical Language Models from Interpretation Grammars in Dialogue Systems

» Natural Language Processing for Usage Based Indexing of Web Resources

Post Info
More Details (n/a)

Added	07 Nov 2010
Updated	07 Nov 2010
Type	Conference
Year	1992
Where	COLING
Authors	Philip Resnik

Comments (0)