The semantics of grammar formalisms seen as computer languages
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
The design of a computer language for linguistic information
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Processing English with a Generalized Phrase Structure Grammar
ACL '82 Proceedings of the 20th annual meeting on Association for Computational Linguistics
Sentence disambiguation by a shift-reduce parsing technique
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
An efficient augmented-context-free parsing algorithm
Computational Linguistics
Unification: a multidisciplinary survey
ACM Computing Surveys (CSUR)
A parsing algorithm for unification grammar
Computational Linguistics
Semantic-head-driven generation
Computational Linguistics
Finite-state approximations of grammars
HLT '90 Proceedings of the workshop on Speech and Natural Language
Restriction and termination in parsing with feature-theoretic grammars
Computational Linguistics
Research actvities on natural language processing of the FGCS project
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
An Opterational Model for Parsing Definite Clause Grammars with Infinite Terms
LACL '97 Selected papers from the Second International Conference on Logical Aspects of Computational Linguistics
Preprocessing for Unification Parsing of Spoken Language
NLP '00 Proceedings of the Second International Conference on Natural Language Processing
Generalized probabilistic LR parsing of natural language (Corpora) with unification-based grammars
Computational Linguistics - Special issue on using large corpora: I
The interface between phrasal and functional constraints
Computational Linguistics
Nonminimal derivations in unification-based parsing
Computational Linguistics
An efficient implementation of the head-corner parser
Computational Linguistics
On the complexity of ID/LP parsing 1
Computational Linguistics
An HPSG parser with CFG filtering
Natural Language Engineering
Parser engineering and performance profiling
Natural Language Engineering
Ambiguity packing in constraint-based parsing: practical results
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Efficient generation of random sentences
Natural Language Engineering
Head-driven parsing for lexicalist grammars: experimental results
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
A tractable extension of Linear Indexed Grammars
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
An extended LR parsing algorithm for grammars using feature-based syntactic categories
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Prediction in chart parsing algorithms for Categorial Unification Grammar
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
An extension of earley's algorithm for S-attributed grammars
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Approximating context-free grammars with a finite-state calculus
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
Unification and some new grammatical formalisms
TINLAP '87 Proceedings of the 1987 workshop on Theoretical issues in natural language processing
Finite-state approximation of constraint-based grammars using left-corner grammar transforms
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
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
Finite-state approximation of phrase structure grammars
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
A semantic-head-driven generation algorithm for unification-based formalisms
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
A generalization of the offline parsable grammars
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Memoization of coroutined constraints
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Interleaving syntax and semantics in an efficient bottom-up parser
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Zero morphemes in unification-based combinatory categorial grammar
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Asymmetry in parsing and generating with unification grammars: case studies from ELU
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Magic for filter optimization in dynamic bottom-up processing
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Maximizing top-down constraints for unification-based systems
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Japanese sentence analysis as argumentation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Computing first and follow functions for feature theoretic grammars
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Conditioned unification for natural language processing
COLING '86 Proceedings of the 11th coference on Computational linguistics
Categorial unification grammars
COLING '86 Proceedings of the 11th coference on Computational linguistics
A simple reconstruction of GPSG
COLING '86 Proceedings of the 11th coference on Computational linguistics
Functional structures for parsing dependency constraints
COLING '86 Proceedings of the 11th coference on Computational linguistics
Another stride towards knowledge-based machine translation
COLING '86 Proceedings of the 11th coference on Computational linguistics
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Parsing strategies with 'lexicalized' grammars: application to tree adjoining grammars
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
A uniform architecture for parsing and generation
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Feature structures based Tree Adjoining Grammars
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
A modular architecture for constraint-based parsing
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Chart parsing of robust grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
A generalized Greibach Normal Form for definite clause grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
An HPSG-to-CFG approximation of Japanese
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
Top-down predictive linking and complex-feature-based formalisms
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Computing phrasal-signs in HPSG prior to parsing
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Generating French with a reversible unification grammar
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
A bag of useful techniques for efficient and robust parsing
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Practical issues in compiling typed unification grammars for speech recognition
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
On two classes of feature paths in large-scale unification grammars
New developments in parsing technology
A context-free superset approximation of unification-based grammars
New developments in parsing technology
From ubgs to cfgs a practical corpus-driven approach
Natural Language Engineering
Feature forest models for probabilistic hpsg parsing
Computational Linguistics
Local ambiguity packing and discontinuity in German
DeepLP '07 Proceedings of the Workshop on Deep Linguistic Processing
Efficient HPSG parsing with supertagging and CFG-filtering
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Parallel parsing for unification grammars
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2
The universal parser architecture for knowledge-based machine translation
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2
Toward the formal verification of a unification system
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Toward the formal verification of a unification system
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
Unification-based grammars and tabular parsing for graphical languages
Journal of Visual Languages and Computing
Left-corner unification-based natural language processing
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Computational linguistics and natural language processing
CICLing'11 Proceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part I
High efficiency realization for a wide-coverage unification grammar
IJCNLP'05 Proceedings of the Second international joint conference on Natural Language Processing
Precompilation of HPSG in ALE into a CFG for fast parsing
Proceedings of the COLING-2000 Workshop on Efficiency In Large-Scale Parsing Systems
Rediscovering ACL discoveries through the lens of ACL anthology network citing sentences
ACL '12 Proceedings of the ACL-2012 Special Workshop on Rediscovering 50 Years of Discoveries
The ACL anthology network corpus
Language Resources and Evaluation
Hi-index | 0.00 |
Grammar formalisms based on the encoding of grammatical information in complex-valued feature systems enjoy some currency both in linguistics and natural-language-processing research. Such formalisms can be thought of by analogy to context-free grammars as generalizing the notion of nonterminal symbol from a finite domain of atomic elements to a possibly infinite domain of directed graph structures of a certain sort. Unfortunately, in moving to an infinite nonterminal domain, standard methods of parsing may no longer be applicable to the formalism. Typically, the problem manifests itself as gross inefficiency or even nontermination of the algorithms. In this paper, we discuss a solution to the problem of extending parsing algorithms to formalisms with possibly infinite nonterminal domains, a solution based on a general technique we call restriction. As a particular example of such an extension, we present a complete, correct, terminating extension of Earley's algorithm that uses restriction to perform top-down filtering. Our implementation of this algorithm demonstrates the drastic elimination of chart edges that can be achieved by this technique. Finally, we describe further uses for the technique---including parsing other grammar formalisms, including definite-clause grammars; extending other parsing algorithms, including LR methods and syntactic preference modeling algorithms; and efficient indexing.