Deterministic consistency checking of LP constraints

Authors:
Suresh Manandhar
Affiliations:
University of Edinburgh, Scotland
Venue:
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Year:
1995

Citing 10
Cited 3

Information-based syntax and semantics: Vol. 1: fundamentals

Information-based syntax and semantics: Vol. 1: fundamentals
Concurrent constraint programming

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The logic of typed feature structures

The logic of typed feature structures
Feature-constraint logics for unification grammars

Journal of Logic Programming
Concurrent constraint programming

Concurrent constraint programming
Functions as passive constraints in LIFE

ACM Transactions on Programming Languages and Systems (TOPLAS)
ProFIT: prolog with features, inheritance and templates

EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Horn extended feature structures: fast unification with negation and limited disjunction

EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
An attributive logic of set descriptions and set operations

ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Treating 'free word order' in machine translation

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1

ProFIT: prolog with features, inheritance and templates

EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Topological parsing

EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
IDL-expressions: a formalism for representing and parsing finite languages in natural language processing

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a constraint based computational model of linear precedence as employed in the HPSG grammar formalism. An extended feature logic which adds a wide range of constraints involving precedence is described. A sound, complete and terminating deterministic constraint solving procedure is given. Deterministic computational model is achieved by weakening the logic such that it is sufficient for linguistic applications involving word-order.