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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
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
104
click to vote
COLING
2010
96
views
Computational Linguistics
»
more
COLING 2010
»
Normal-form parsing for Combinatory Categorial Grammars with generalized composition and type-raising
14 years 9 months ago
Download
nlp.cs.illinois.edu
We propose and implement a modification of the Eisner (1996) normal form to account for generalized composition of bounded degree, and an extension to deal with grammatical type-raising.
Julia Hockenmaier, Yonatan Bisk
Real-time Traffic
COLING 2010
|
Computational Linguistics
|
Normal Form
|
claim paper
Related Content
»
Efficient NormalForm Parsing for Combinatory Categorial Grammar
more »
Post Info
More Details (n/a)
Added
13 May 2011
Updated
13 May 2011
Type
Journal
Year
2010
Where
COLING
Authors
Julia Hockenmaier, Yonatan Bisk
Comments
(0)
Researcher Info
Computational Linguistics Study Group
Computer Vision