Experiments with Learning Parsing Heuristics
Abstract
References
- Experiments with Learning Parsing Heuristics
Recommendations
LLLR parsing
SAC '13: Proceedings of the 28th Annual ACM Symposium on Applied ComputingThe idea of an LLLR parsing is presented. An LLLR(k) parser can be constructed for any LR(k) grammar but it produces the left parse of the input string in linear time (in respect to the length of the derivation) without backtracking. If used as a basis ...
Heuristics for broad-coverage natural language parsing
HLT '93: Proceedings of the workshop on Human Language TechnologyThe Slot Grammar system is interesting for natural language applications because it can deliver parses with deep grammatical information on a reasonably broad scale. The paper describes a numerical scoring system used in Slot Grammar for ambiguity ...
Comments
Information & Contributors
Information
Published In
Sponsors
- Government of Canada
- Université de Montréal
Publisher
Association for Computational Linguistics
United States
Publication History
Qualifiers
- Article
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 311Total Downloads
- Downloads (Last 12 months)28
- Downloads (Last 6 weeks)5
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in