Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming

DOI10.1007/978-3-642-30743-0_30MaRDI QIDQ2900538zbMATH OpenOpenAlexFDO

Authors Yuliya Lierler, Peter Schüller

Publication date 23 July 2012

Published in Correct Reasoning (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1108.5567

Mathematics Subject Classification ID

Logic programming (68N17) Natural language processing (68T50)

Abstract: Combinatory categorial grammar (CCG) is a grammar formalism used for natural language parsing. CCG assigns structured lexical categories to words and uses a small set of combinatory rules to combine these categories to parse a sentence. In this work we propose and implement a new approach to CCG parsing that relies on a prominent knowledge representation formalism, answer set programming (ASP) - a declarative programming paradigm. We formulate the task of CCG parsing as a planning problem and use an ASP computational tool to compute solutions that correspond to valid parses. Compared to other approaches, there is no need to implement a specific parsing algorithm using such a declarative method. Our approach aims at producing all semantically distinct parse trees for a given sentence. From this goal, normalization and efficiency issues arise, and we deal with them by combining and extending existing strategies. We have implemented a CCG parsing tool kit - AspCcgTk - that uses ASP as its main computational means. The C&C supertagger can be used as a preprocessor within AspCcgTk, which allows us to achieve wide-coverage natural language parsing.

Recommendations

• Flexible combinatory categorial grammar parsing using the CYK algorithm and answer set programming
• Abstract categorial parsing as linear logic programming
• Modelling grammar constraints with answer set programming
• scientific article; zbMATH DE number 1523041
• Parsing/theorem-proving for logical grammar \textit{CatLog3}
• Answer set programming and plan generation

Cites work

• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 1368933 (Why is no real title available?)
• A logic programming approach to knowledge-state planning, semantics and complexity
• Answer set programming and plan generation
• CCGbank: A Corpus of CCG Derivations and Dependency Structures Extracted from the Penn Treebank
• Conflict-Driven Answer Set Enumeration
• Engineering an Incremental ASP Solver
• Logic programs with stable model semantics as a constraint programming paradigm
• Modelling grammar constraints with answer set programming
• Paramils: an automatic algorithm configuration framework
• Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
• Welfare Economics and Robinson Crusoe the Producer
• Wide-coverage efficient statistical parsing with CCG and log-linear models

Cited in

(8)

• Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
• Wide-coverage efficient statistical parsing with CCG and log-linear models
• System predictor: grounding size estimator for logic programs under answer set semantics
• Performance tuning in answer set programming
• Specifying and verbalising answer set programs in controlled natural language
• Implementing variable vectors in a CCG parser
• Flexible combinatory categorial grammar parsing using the CYK algorithm and answer set programming
• Efficient benchmarking of algorithm configurators via model-based surrogates

Describes a project that uses

Uses Software

• IDPDraw
• iClingo
• Clingo
• Penn Treebank
• CCGbank
• clasp
• PDDL
• Gringo
• Paramils

This page was built for publication: Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2900538)