• Home
  • CLT seminar: Inari Listenmaa – Analysing Constraint Grammars using a SAT solver

CLT seminar: Inari Listenmaa – Analysing Constraint Grammars using a SAT solver

SEMINAR

Constraint Grammar (CG) is a formalism used to disambiguate morphologically analysed text. A grammar written in CG contains rules that /select/ or /remove/ an analysis, based on what other words surround the target word. An example of such rule is [REMOVE verb IF -1 determiner]: given an ambiguous text such as "the wish", the rule would disambiguate /wish/ into a noun.

A typical grammar contains hundreds to thousands of such rules. Since the rules are very shallow and depend on the context of words, it easy to accidentally write rules that conflict each other, or that can never apply to any output.

In this talk, I describe a method for analysing CG by encoding the rules in SAT (joint work with Koen Claessen). Our tools can detect internal conflicts or redundancies in a grammar, as well as generate examples to demonstrate the effect of some rule or rule set. This can help users to diagnose and improve their grammars. No corpus is required, only a morphological lexicon.

Date: 2016-02-25 10:30 - 12:00

Location: L308, Lennart Torstenssonsgatan 8

Permalink

add to Outlook/iCal

To the top

Page updated: 2016-02-21 17:02

Send as email
Print page
Show as pdf

X
Loading