Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
From MaRDI portal
Publication:2900538
DOI10.1007/978-3-642-30743-0_30zbMATH Open1357.68256arXiv1108.5567OpenAlexW2197846518MaRDI QIDQ2900538FDOQ2900538
Authors: Yuliya Lierler, Peter Schüller 
Publication date: 23 July 2012
Published in: Correct Reasoning (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1108.5567
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
- Paramils: an automatic algorithm configuration framework
- Title not available (Why is that?)
- Answer set programming and plan generation
- Logic programs with stable model semantics as a constraint programming paradigm
- Title not available (Why is that?)
- Engineering an Incremental ASP Solver
- Conflict-Driven Answer Set Enumeration
- A logic programming approach to knowledge-state planning
- Welfare Economics and Robinson Crusoe the Producer
- Wide-coverage efficient statistical parsing with CCG and log-linear models
- Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
- Modelling grammar constraints with answer set programming
- CCGbank: A Corpus of CCG Derivations and Dependency Structures Extracted from the Penn Treebank
Cited In (7)
- Specifying and Verbalising Answer Set Programs in Controlled Natural Language
- Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
- Wide-coverage efficient statistical parsing with CCG and log-linear models
- Performance tuning in answer set programming
- 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
Uses Software
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)
