Using Restriction to Extend Parsing Algorithms for Complex-Feature-Based Formalisms (1985)
by
Stuart M. Shieber
| Venue: | In 23th Annual Meeting of the Association for Computational Linguistics |
| Citations: | 82 - 3 self |
BibTeX
@INPROCEEDINGS{Shieber85usingrestriction,
author = {Stuart M. Shieber},
title = {Using Restriction to Extend Parsing Algorithms for Complex-Feature-Based Formalisms},
booktitle = {In 23th Annual Meeting of the Association for Computational Linguistics},
year = {1985},
pages = {145--152}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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
Citations
| 389 | The proper treatment of quantification in ordinary English - Montague |
| 135 | Parsing as deduction - Pereira, Warren - 1983 |
| 75 | The formalism and implementation of PATR-II - Shieber, Uszkoreit, et al. - 1983 |
| 42 | The semantics of -grammar formalisms seen as computer languages - Pereira, Shieber - 1984 |
| 42 | The design of a computer language for linguistic information - Shieber - 1984 |
| 38 | Sentence disambiguation by shift-reduce parsing technique - Shieber - 1983 |
| 32 | On the order of words. Linguistics and Philosophy - Ades, Steedman - 1982 |
| 7 | Processing English with a generalized phrase structure grammar - Gawron, King, et al. - 1982 |
| 6 | Criteria for designing computer facilities for linguistic analysis - Shieber - 1985 |
| 1 | BUP: a bottom-up parser embeddad - Miyoshi, Yasukawa - 1983 |
| 1 | Logic for natural language anal.vsis - Pereira - 1983 |
| 1 | Indexing Prol.g clauses via superimposed code words and lield encoded words - Wise, W, et al. - 1984 |
