Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

PDF

Selected Works

Yuliya Lierler

Syntactic Parsing by Means of Declarative Programming

Publication Year

Articles 1 - 4 of 4

Full-Text Articles in Physical Sciences and Mathematics

Aspccgtk: Towards Syntactic Parsing With Semantic Disambiguation, Yuliya Lierler, Peter Schueller Nov 2014

Aspccgtk: Towards Syntactic Parsing With Semantic Disambiguation, Yuliya Lierler, Peter Schueller

Yuliya Lierler

Natural language expressions are often ambiguous, allowing multiple interpretations. In this note we describe an approach that integrates syntactic analysis with semantic constraints in a system called ASPCCGTK. This system is based on Answer Set Programming — a popular declarative constraint programming paradigm.


Parsing Combinatory Categorial Grammar With Answer Set Programming: Preliminary Report, Yuliya Lierler, Peter Schüller Nov 2013

Parsing Combinatory Categorial Grammar With Answer Set Programming: Preliminary Report, Yuliya Lierler, Peter Schüller

Yuliya Lierler

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 …


Towards A Tight Integration Of Syntactic Parsing With Semantic Disambiguation By Means Of Declarative Programming, Yuliya Lierler, Peter Schüller Nov 2013

Towards A Tight Integration Of Syntactic Parsing With Semantic Disambiguation By Means Of Declarative Programming, Yuliya Lierler, Peter Schüller

Yuliya Lierler

We propose and advocate the use of an advanced declarative programming paradigm – answer set programming – as a uniform platform for integrated approach towards syntax-semantic processing in natural language. We illustrate that (a) the parsing technology based on answer set programming implementation reaches performance sufficient for being a useful NLP tool, and (b) the proposed method for incorporating semantic information from FRAMENET into syntactic parsing may prove to be useful in allowing semantic-based disambiguation of syntactic structures.


Parsing Combinatory Categorial Grammar Via Planning In Answer Set Programming, Yuliya Lierler, Peter Schueller Dec 2011

Parsing Combinatory Categorial Grammar Via Planning In Answer Set Programming, Yuliya Lierler, Peter Schueller

Yuliya Lierler

Essay, Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming, from Correct reasoning: essays on logic-based AI in honour of Vladimir Lifschitz, co-authored by Yuliya Lierler, UNO faculty member.
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 …