Answer set programming: Difference between revisions

Revision as of 17:23, 11 May 2020

Revision as of 15:37, 20 May 2020

Line 217:

===Dependency parsing===

In [[natural language processing]], [[parsing|dependency-based parsing]] can be formulated as an ASP problem.<ref>{{Cite web |url=http://loqtek.com/?id=course_pars&sec=1 |title=Dependency parsing |access-date=2015-04-15 |archive-url=https://archive.is/20150415155632/http://loqtek.com/?id=course_pars&sec=1 |archive-date=2015-04-15 |url-status=dead }}</ref>

The following code parses the Latin sentence '''"Puella pulchra in villa linguam latinam discit'''", "the pretty girl is learning Latin in the villa".

The syntax tree is expressed by the ''arc'' predicates which represent the dependencies between the words of the sentence.

The computed structure is a linearly ordered rooted tree.