Ambiguity Resolution In A Reductionistic Parser (1993)
by
Atro Voutilainen
,
Pasi Tapanainen
| Citations: | 29 - 4 self |
BibTeX
@MISC{Voutilainen93ambiguityresolution,
author = {Atro Voutilainen and Pasi Tapanainen},
title = {Ambiguity Resolution In A Reductionistic Parser},
year = {1993}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We ae concerned with dependencyoriented morphosyntactic parsing of run- ning text. While a parsing grammar should avoid introducing structurally unresolvable distinctions in order to optimise on the accuracy of the parser, it also is beneficial for the grammaxian to have as expressive a structural representation available as possible.
Citations
| 649 | A stochastic parts program and noun phrase parser for unrestricted text - Church - 1988 |
| 142 | eds. Constraint Grammar – A Language-Independent System for Parsing Unrestricted Text. Mouton de Gruyter - Karlsson, Voutilainen, et al. - 1995 |
| 94 | The computational analysis of English. A corpus-based approach - Garside, Leech, et al. - 1987 |
| 83 | Constraint Grammar as a Framework for Parsing Running Text - Karlsson - 1990 |
| 26 | Current Practice in Part of Speech Tagging and Suggestions for the Future - Church - 1992 |
