on Advances in artificial intelligence
Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
Computational Linguistics
Computational Linguistics
Phonological analysis in typed feature systems
Computational Linguistics - Special issue on computational phonology
Computational Linguistics
Head-driven parsing for lexicalist grammars: experimental results
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
ProFIT: prolog with features, inheritance and templates
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
A logical semantics for feature structures
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
A unification method for disjunctive feature descriptions
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
AIMSA '00 Proceedings of the 9th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
Unscrambling English word order
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
A grammar formalism and parser for linearization-based HPSG
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Towards including prosody in a text-to-speech system for modern standard Arabic
Computer Speech and Language
Journal of Artificial Intelligence Research
Local constraints on arabic word order
FinTAL'06 Proceedings of the 5th international conference on Advances in Natural Language Processing
| Hi-index | 0.00 |
Most parsing algorithms require phrases that are to be combined to be either contiguous or marked as being ‘extraposed’. The assumption that phrases which are to be combined will be adjacent to one another supports rapid indexing mechanisms: the fact that in most languages items can turn up in unexpected locations cancels out much of the ensuing efficiency. The current paper shows how ‘out of position’ items can be incorporated directly. This leads to efficient parsing even when items turn up having been right-shifted, a state of affairs which makes Johnson and Kay's (1994) notion of ‘sponsorship’ of empty nodes inapplicable.