Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
The logic of typed feature structures
The logic of typed feature structures
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Introduction to this Special Issue
Natural Language Engineering
An HPSG parser with CFG filtering
Natural Language Engineering
LiLFeS: towards a practical HPSG parser
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
HPSG-style underspecified Japanese grammar with wide coverage
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Packing of feature structures for efficient unification of disjunctive feature structures
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Measure for measure: towards increased component comparability and exchange
New developments in parsing technology
Offline compilation of chains for head-driven generation with constraint-based grammars
CICLing'03 Proceedings of the 4th international conference on Computational linguistics and intelligent text processing
| Hi-index | 0.00 |
This paper describes techniques to compile lexical entries in HPSG (Pollard and Sag, 1987; Pollard and Sag, 1993)-style grammar into a set of finite state automata. The states in automata are possible signs derived from lexical entries and contain information raised from the lexical entries. The automata are augmented with feature structures used by a partial unification routine and delayed/frozen definite clause programs.