Tree-bank grammars
Conference
·
OSTI ID:430779
- Brown Univ., Providence, RI (United States)
By a {open_quotes}tree-bank grammar{close_quotes} we mean a context-free grammar created by reading the production rules directly from hand-parsed sentences in a tree bank. Common wisdom has it that such grammars do not perform well, though we know of no published data on the issue. The primary purpose of this paper is to show that the common wisdom is wrong. In particular, we present results on a tree-bank grammar based on the Penn Wall Street Journal tree bank. To the best of our knowledge, this grammar outperforms all other non-word-based statistical parsers/grammars on this corpus. That is, it outperforms parsers that consider the input as a string of tags and ignore the actual words of the corpus.
- OSTI ID:
- 430779
- Report Number(s):
- CONF-960876-; TRN: 96:006521-0154
- Resource Relation:
- Conference: 13. National conference on artifical intelligence and the 8. Innovative applications of artificial intelligence conference, Portland, OR (United States), 4-8 Aug 1996; Other Information: PBD: 1996; Related Information: Is Part Of Proceedings of the thirteenth national conference on artificial intelligence and the eighth innovative applications of artificial intelligence conference. Volume 1 and 2; PB: 1626 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Generalized queries on probabilistic context-free grammars
LR; LR(1) grammar analyzer and parser generator. [IBM370; FORTRAN (ANSI X3. 9-1966)]
Parallel parsing of tree adjoining grammars on the connection machine
Conference
·
Tue Dec 31 00:00:00 EST 1996
·
OSTI ID:430779
LR; LR(1) grammar analyzer and parser generator. [IBM370; FORTRAN (ANSI X3. 9-1966)]
Technical Report
·
·
OSTI ID:430779
Parallel parsing of tree adjoining grammars on the connection machine
Journal Article
·
Sat Feb 01 00:00:00 EST 1992
· International Journal of Parallel Programming; (United States)
·
OSTI ID:430779