Design of LMT: a prolog-based machine translation system
Computational Linguistics
Anaphora resolution in slot grammar
Computational Linguistics
Slot Grammar: A System for Simpler Construction of Practical Natural Language Grammars
Proceedings of the International Symposium on Natural Language and Logic
Computational Linguistics
Experience with an easily computed metric for ranking alternative parsess
ACL '82 Proceedings of the 20th annual meeting on Association for Computational Linguistics
A syntactic filter on pronominal anaphora for Slot Grammar
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Two principles of parse preference
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Automatic processing of large corpora for the resolution of anaphora references
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
An algorithm for pronominal anaphora resolution
Computational Linguistics
Training and scaling preference functions for disambiguation
Computational Linguistics
NLP '00 Proceedings of the Second International Conference on Natural Language Processing
Easy English: Addressing Structural Ambiguity
AMTA '98 Proceedings of the Third Conference of the Association for Machine Translation in the Americas on Machine Translation and the Information Soup
The LMT Transformational System
AMTA '98 Proceedings of the Third Conference of the Association for Machine Translation in the Americas on Machine Translation and the Information Soup
The Effect of Source Analysis on Translation Confidence
AMTA '00 Proceedings of the 4th Conference of the Association for Machine Translation in the Americas on Envisioning Machine Translation in the Information Future
EasyEnglish: a tool for improving document quality
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
Fast parsing using pruning and grammar specialization
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
XTAG system: a wide coverage grammar for English
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Two-way adaptation for robust input interpretation in practical multimodal conversation systems
Proceedings of the 10th international conference on Intelligent user interfaces
Improving a statistical MT system with automatically learned rewrite patterns
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Multi-lingual coreference resolution with syntactic features
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Symbolic preference using simple scoring
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
Semitic '07 Proceedings of the 2007 Workshop on Computational Approaches to Semitic Languages: Common Issues and Resources
Lappin and leass’ algorithm for pronoun resolution in portuguese
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
Improving natural language processing by linguistic document annotation
Proceedings of the COLING-2000 Workshop on Semantic Annotation and Intelligent Content
IBM Journal of Research and Development
| Hi-index | 0.00 |
The 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 resolution, which not only ranks parses but also contributes to parsing efficiency through a parse space pruning algorithm. Details of the method of computing parse scores are given, and test results for the English Slot Grammar are presented.