Abstract:
Abstract. A desirable goal of constraint-based parsing is that the whole process should be one of pure algorithmic constraint satisfaction; the implementor should not need to specify any control information, or be aware of how the underlying system implements control. Unfortunately, most existing tools are Turing complete, and hence require additional control information by virtue of their computational power. In this work, a first step towards automatic contraint-based parsing of HPSG is provided, in the form of a family of decidable (for satisfiability) logics in which set and list constructions may be expressed in a uniform fashion, and constraints such as the Nonlocal Feature Principle may be recaptured succinctly.
Citations
|
860
|
Head-Driven Phrase Structure Grammar
– Pollard, Sag
- 1994
|
|
724
|
Introduction to Lattices and Order
– Davey, Priestley
- 2002
|
|
270
|
The logic of typed feature structures
– Carpenter
- 1992
|
|
231
|
Elements of the Theory of Computation
– Lewis, Papadimitriou
- 1981
|
|
139
|
Parsing as Deduction
– Pereira, Warren
- 1983
|
|
139
|
Information-based Syntax and Semantics Volume 1: Fundamentals
– Pollard, Sag
- 1987
|
|
89
|
An expanded logical formalism for Head-driven Phrase Structure Grammar. Arbeitspapiere des Sonderforschungsbereichs 340 Bericht Nr. 59, Seminar für Sprachwissenschaft
– King
- 1994
|
|
73
|
The Decision Problem: Solvable Classes of Quantificational Formulas
– Dreben, Goldfarb
- 1979
|
|
50
|
ALE: The Attribute Logic Engine user’s guide
– Carpenter
- 1992
|
|
44
|
Logic for Computer Science
– Gallier
- 1986
|
|
26
|
An attributive logic of set descriptions and set operations
– Manandhar
- 1994
|
|
24
|
Features and formulae
– Johnson
- 1991
|
|
21
|
The logic of unification in grammar
– Kasper, Rounds
- 1990
|
|
19
|
Mathematical Logic
– Monk
- 1976
|
|
11
|
A satisfiability algorithm for a typed feature logic
– Kepser
- 1993
|
|
8
|
Computing with Features as Formulae
– Johnson
- 1994
|
|
7
|
Representations and interpretations
– Fenstad, Langholm, et al.
- 1989
|
|
7
|
Two ways of formalizing grammars
– Johnson
- 1994
|
|
5
|
Notes on the Typed Feature System, Version 4
– Zajac
- 1991
|
|
3
|
The CUF user’s manual
– Dorna
- 1994
|
|
1
|
Set descriptions for logic programming. Paper presented at the 3rd ASL/LSA Conference on Logic and Language. Also referenced under the title: An attribute-value logic for sets
– Carpenter
- 1993
|
|
1
|
Distributivity in incompletly specified type hierarchies: Theory and computational complexity
– Hegner
- 1994
|
|
1
|
The domain of set-valued feature structures
– Moshier, Pollard
- 1994
|
|
