Efficient Processing with CCG
Efficient Processing with CCG
Combinatory Categorial Grammar (CCG) allows semantically equivalent alternate surface derivations typified by the sentence “Harry admires Louise,” as well as English noun phrases, to have all of the type-raised categories allowed by a full-blown morphological case system. Many critics have argued that this so-called spurious ambiguity makes CCG quite impracticable to apply to useful tasks such as parsing and question answering in open domains, regardless of its linguistic attractions. This chapter examines how CCG can be used for efficient natural language processing. It first considers algorithms that have formed the basis of a number of practical CCG parsers before turning to logical forms and how they are built with CCG. The chapter also discusses processing scope and pronominal reference in CCG, generation of strings from logical forms using CCG, the use of scope for rapid inference in support of question answering or textual entailment, and human sentence processing.
Keywords: parsing, Combinatory Categorial Grammar, question answering, natural language processing, logical forms, processing scope, pronominal reference, strings, entailment, human sentence processing
MIT Press Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
Please, subscribe or login to access full text content.
If you think you should have access to this title, please contact your librarian.
To troubleshoot, please check our FAQs, and if you can't find the answer there, please contact us.
