The interface between phrasal and functional constraints

Authors:
John T. Maxwell;Ronald M. Kaplan
Affiliations:
Xerox Palo Alto Research Center;Xerox Palo Alto Research Center
Venue:
Computational Linguistics
Year:
1993

Citing 19
Cited 37

Algorithm schemata and data structures in syntactic processing

Readings in natural language processing
Information-based syntax and semantics: Vol. 1: fundamentals

Information-based syntax and semantics: Vol. 1: fundamentals
Unification: a multidisciplinary survey

ACM Computing Surveys (CSUR)
Fast Decision Procedures Based on Congruence Closure

Journal of the ACM (JACM)
An efficient context-free parsing algorithm

Communications of the ACM
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems

Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Computational Complexity and Natural Language

Computational Complexity and Natural Language
Coping with syntactic ambiguity or how to put the block in the box on the table

Computational Linguistics
Localizing expression of ambiguity

ANLC '88 Proceedings of the second conference on Applied natural language processing
Canonical representation in NLP system design: a critical evaluation

ANLC '88 Proceedings of the second conference on Applied natural language processing
A unification method for disjunctive feature descriptions

ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Using restriction to extend parsing algorithms for complex-feature-based formalisms

ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Polynomial time and space shift-reduce parsing of arbitrary context-free grammars

ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Constraint projection: an efficient treatment of disjunctive feature descriptions

ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Lazy unification

ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
D-PATR: a development environment for unification-based grammars

COLING '86 Proceedings of the 11th coference on Computational linguistics
Conditioned unification for natural language processing

COLING '86 Proceedings of the 11th coference on Computational linguistics
Island parsing and bidirectional charts

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
An empirical study on rule granularity and unification interleaving toward an efficient unification-based parsing system

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1

CACTUS: automated tutorial course generation for software applications

Proceedings of the 5th international conference on Intelligent user interfaces
Model-Based Graphics Recognition

GREC '99 Selected Papers from the Third International Workshop on Graphics Recognition, Recent Advances
Computing with features as formulae

Computational Linguistics
Efficient construction of underspecified semantics under massive ambiguity

ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Syntactic and semantic transfer with f-structures

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Ambiguity preserving machine translation using packed representations

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Constraint-based Categorial Grammar

ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Relating complexity to practical performance in parsing with wide-coverage unification grammars

ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Anytime algorithms for speech parsing?

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Context-Free grammar rewriting and the transfer of packed linguistic representations

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Modularizing codescriptive grammars for efficient parsing

COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Best analysis selection in inflectional languages

COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Parsing the wall street journal using a Lexical-Functional Grammar and discriminative estimation techniques

ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Comparison between CFG filtering techniques for LTAG and HPSG

ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2
Urdu and the Parallel Grammar project

COLING '02 Proceedings of the 3rd workshop on Asian language resources and international standardization - Volume 12
The Parallel Grammar project

COLING-GEE '02 Proceedings of the 2002 workshop on Grammar engineering and evaluation - Volume 15
Adapting existing grammars: the XLE experience

COLING-GEE '02 Proceedings of the 2002 workshop on Grammar engineering and evaluation - Volume 15
Entailment, intensionality and text understanding

HLT-NAACL-TEXTMEANING '03 Proceedings of the HLT-NAACL 2003 workshop on Text meaning - Volume 9
On two classes of feature paths in large-scale unification grammars

New developments in parsing technology
Optimal ambiguity packing in context-free parsers with interleaved unification

New developments in parsing technology
How much can part-of-speech tagging help parsing?

Natural Language Engineering
Deep dependencies from context-free statistical parsers: correcting the surface dependency approximation

ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
A relational syntax-semantics interface based on dependency grammar

COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Generalizing dimensionality in combinatory categorial grammar

COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Multilevel coarse-to-fine PCFG parsing

HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Pruning the search space of a hand-crafted parsing system with a probabilistic parser

DeepLP '07 Proceedings of the Workshop on Deep Linguistic Processing
Backbone extraction and pruning for speeding up a deep parser for dialogue systems

ScaNaLU '06 Proceedings of the Third Workshop on Scalable Natural Language Understanding
Charts, interaction-free grammars, and the compact representation of ambiguity

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Efficient and robust LFG parsing: SxLfg

Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Efficacy of beam thresholding, unification filtering and hybrid parsing in probabilistic HPSG parsing

Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Creating an annotated corpus for generating walking directions

UCNLG+Sum '09 Proceedings of the 2009 Workshop on Language Generation and Summarisation
Left-corner unification-based natural language processing

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
RTG based surface realisation for TAG

COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Computing EM-based alignments of routes and route directions as a basis for natural language generation

COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Using regular tree grammars to enhance sentence realisation

Natural Language Engineering
Efficient large-scale parsing: a survey

Proceedings of the COLING-2000 Workshop on Efficiency In Large-Scale Parsing Systems
Large scale parsing of Czech

Proceedings of the COLING-2000 Workshop on Efficiency In Large-Scale Parsing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many modern grammatical formalisms divide the task of linguistic specification into a context=free component of phrasal constraints and a separate component of attribute-value or functional constraints. Conventional methods for recognizing the strings of a language also divide into two parts so that they can exploit the different computational properties of these components. This paper focuses on the interface between these components as a source of computational complexity distinct from the complexity internal to each. We first analyze the common hybrid strategy in which a polynomial context-free parser is modified to interleave functional constraint solving with context-free constituent analysis. This strategy depends on the property of monotonicity in order to prune unnecessary computation. We describe a number of other properties that can be exploited for computational advantage, and we analyze some alternative interface strategies based on them. We present the results of preliminary experiments that generally support our intuitive analyses. A surprising outcome is that under certain circumstances an algorithm that does no pruning in the interface may perform significantly better than one that does.