Sergei Nirenburg
ABSTRACT
This paper introduces Boas, a semi-automatic knowledge elicitation system that guides a team of two people through the process of developing the static knowledge sources for a moderate-quality, broad-coverage MT system from any "low-density" language into English in about six months. The paper focuses on some issues in the elicitation of descriptive knowledge in Boas and also the issue of the principled reuse of pre-existing resources, such as a lexicon, an ontology, and an English generation module, among others, made possible by the fact that the client MT system is developed for a single target language.
- Chomsky, N. 1981. Lectures on Government and Binding. Dordrecht: Foris.Google Scholar
- Chomsky, N. 1986. Knowledge of Language: Its Nature, Origin, and Use. New York: Praeger.Google Scholar
- Chomsky, N. 1995. The Minimalist Program. Cambridge, MA: MIT Press.Google Scholar
- Comrie, B., and N. Smith 1977. Lingua Descriptive Studies: Questionnaire. Lingua 42: 1, pp. 1--72.Google ScholarCross Ref
- Culikover, P. W. 1997. Principles and Parameters. An Introduction to Syntactic Theory. Oxford University Press.Google Scholar
- Dorr, B. 1993. Interlingual Machine Translation: A Parametrized Approach. Artificial Intelligence 63, 429--92. Google ScholarDigital Library
- Lightfoot, D. 1991. How to Set Parameters. Cambridge, MA: MIT PressGoogle Scholar
- Mahesh, K., and S. Nirenburg 1995. Semantic Classification for Practical Natural Language Processing. In: Proceedings of the Sixth ASIS SIG/ CR Classification Research Workshop: An Interdisciplinary Meeting. Chicago, IL.Google Scholar
- Nirenburg, S. 1998. Project Boas: "A Linguist in the Box" as a Multi-Purpose Language Resource. In: Proceedings of The First Lexical Resources and Evaluation Conference. Granada, Spain.Google Scholar
- Nirenburg, S., and V. Raskin 1996. Ten Choices in Lexical Semantics. MCCS-96-304, Las Cruces, N. M.: NMSU CRL.Google Scholar
- Nirenburg, S., V. Raskin, and B. Onyshkevych 1995. Apologiae Ontologiae. TMI '95, Leuven.Google Scholar
- Onyshkevych, B., and S. Nirenburg. 1995. "A Lexicon for Knowledge-Based MT." Machine Translation, 10: 1--2, pp. 5--57.Google Scholar
- Quirk, R., S. Greenbaum, G. Leech, and J. Svartvik 1985. A Comprehensive Grammar of the English Language. London: Longman.Google Scholar
- Webelhuth, G. 1992. Principles and Parameters of Syntactic Saturation. New York and Oxford: Oxford University Press.Google Scholar
- Universal grammar and lexis for quick ramp-up of MT systems
Recommendations
Tree insertion grammar: a cubic-time, parsable formalism that lexicalizes context-free grammar without changing the trees produced
Tree insertion grammar (TIG) is a tree-based formalism that makes use of tree substitution and tree adjunction. TIG is related to tree adjoining grammar. However, the adjunction permitted in TIG is sufficiently restricted that TIGs only derive context-...
Tree insertion grammar: a cubic-time, parsable formalism that lexicalizes context-free grammar without changing the trees produced
Tree insertion grammar (TIG) is a tree-based formalism that makes use of tree substitution and tree adjunction. TIG is related to tree adjoining grammar. However, the adjunction permitted in TIG is sufficiently restricted that TIGs only derive context-...
Long-distance dependencies and Applicative Universal Grammar
COLING '94: Proceedings of the 15th conference on Computational linguistics - Volume 2To deal with long-distance dependencies, Applicative Universal Grammar (AUG) proposes a new type of categorial rules, called superposition rules. We compare the AUG rules with the alternative rules of Steedman's Combinatory Categorial Grammar (CCG) (...
Comments