Polyadic Dynamic Logics for HPSG Parsing

Authors:
Anders Søgaard;Martin Lange
Affiliations:
Theoretische Computerlinguistik, Institut für Linguistik, Universität Potsdam, Potsdam, Germany;Theoretische Informatik, Institut für Informatik, Ludwig-Maximilians-Universität München, Munich, Germany
Venue:
Journal of Logic, Language and Information
Year:
2009

Citing 13
Cited 0

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

Information-based syntax and semantics: Vol. 1: fundamentals
Constraint-based grammar formalisms: parsing and type inference for natural and computer languages

Constraint-based grammar formalisms: parsing and type inference for natural and computer languages
Approaches to unification in grammar: a brief survey

Specifying syntactic structures
A Theorem on Boolean Matrices

Journal of the ACM (JACM)
Alternation

Journal of the ACM (JACM)
The Complexity of Modellability in Finite and ComputableSignatures of a Constraint Logic for Head-Driven PhraseStructure Grammar

Journal of Logic, Language and Information
Modal logics for finite graphs

Logic for concurrency and synchronisation
The generative power of categorial grammars and head-driven phrase structure grammars with lexical rules

Computational Linguistics
Decidability and undecidability in stand-alone feature logics

EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Expressing generalizations in unification-based grammar formalisms

EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Lexical rules: what are they?

COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Unification Grammars and Off-Line Parsability

Journal of Logic, Language and Information
Logical investigations on the adequacy of certain feature-based theories of natural language

NAACL-DocConsortium '06 Proceedings of the 2006 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology: companion volume: doctoral consortium

Quantified Score

Hi-index	0.00

Visualization

Abstract

Head-driven phrase structure grammar (HPSG) is one of the most prominent theories employed in deep parsing of natural language. Many linguistic theories are arguably best formalized in extensions of modal or dynamic logic (Keller, Feature logics, infinitary descriptions and grammar, 1993; Kracht, Linguistics Philos 18:401---458, 1995; Moss and Tiede, In: Blackburn, van Benthem, and Wolther (eds.) Handbook of modal logic, 2006), and HPSG seems to be no exception. Adequate extensions of dynamic logic have not been studied in detail, however; the most important aspect is the reference to sets of substructures. In this paper, an adequate extension is identified, and some important results are established: Satisfiability is highly undecidable, and model checking is shown to be in EXPTIME and PSPACE-hard. A fragment with polynomial time model checking procedures is identified; it is shown to cover considerable fragments of HPSG.