Michael C. McCord

Also published as: Michael McCord


2011

pdf bib
Abductive Reasoning with a Large Knowledge Base for Discourse Processing
Ekaterina Ovchinnikova | Niloofar Montazeri | Theodore Alexandrov | Jerry Hobbs | Michael C. McCord | Rutu Mulkar-Mehta
Proceedings of the Ninth International Conference on Computational Semantics (IWCS 2011)

2007

pdf bib
An Arabic Slot Grammar Parser
Michael McCord | Violetta Cavalli-Sforza
Proceedings of the 2007 Workshop on Computational Approaches to Semitic Languages: Common Issues and Resources

2006

pdf bib
MT for social impact
Michael McCord
Proceedings of the 7th Conference of the Association for Machine Translation in the Americas: Panel on machine translation for social impact

2004

pdf bib
Improving a Statistical MT System with Automatically Learned Rewrite Patterns
Fei Xia | Michael McCord
COLING 2004: Proceedings of the 20th International Conference on Computational Linguistics

2003

pdf bib
A hybrid approach to deriving selectional preferences
Arendse Bernth | Michael C. McCord
Proceedings of Machine Translation Summit IX: Papers

A hybrid approach to automatic derivation of class-based selectional preferences is proposed. A lexicon of selectional preferences can assist in handling several forms of ambiguity, a major problem for MT. The approach combines knowledge-rich parsing and lexicons, with statistics and corpus data. We illustrate the use of a selectional preference lexicon for anaphora resolution.

2002

pdf bib
An Annotation System for Enhancing Quality of Natural Language Processing
Hideo Watanabe | Katashi Nagao | Michael C. McCord | Arendse Bernth
COLING 2002: The 17th International Conference on Computational Linguistics: Project Notes

2001

pdf bib
Derivational morphology to the rescue: how it can help resolve unfound words in MT
Claudia Gdaniec | Esmé Manandise | Michael C. McCord
Proceedings of Machine Translation Summit VIII

Machine Translation (MT) systems that process unrestricted text should be able to deal with words that are not found in the MT lexicon. Without some kind of recognition, the parse may be incomplete, there is no transfer for the unfound word, and tests for transfers for surrounding words will often fail, resulting in poor translation. Interestingly, not much has been published on unfound- word guessing in the context of MT although such work has been going on for other applications. In our work on the IBM MT system, we implemented a far-reaching strategy for recognizing unfound words based on rules of word formation and for generating transfers. What distinguishes our approach from others is the use of semantic and syntactic features for both analysis and transfer, a scoring system to assign levels of confidence to possible word structures, and the creation of transfers in the transformation component. We also successfully applied rules of derivational morphological analysis to non-derived unfound words.

2000

pdf bib
The effect of source analysis on translation confidence
Arendse Bernth | Michael C. McCord
Proceedings of the Fourth Conference of the Association for Machine Translation in the Americas: Technical Papers

Translations produced by an MT system can automatically be assigned a number that reflects the MT system’s confidence in their quality. We describe the design of such a confidence index, with focus on the contribution of source analysis, which plays a crucial role in many MT systems, including ours. Various problematic areas of source analysis are identified, and their impact on the overall confidence index is given. We will describe two methods of training the confidence index, one by hand-tuning of the heuristics, the other by linear regression analysis.

pdf bib
Improving Natural Language Processing by Linguistic Document Annotation
Hideo Watanabe | Katashi Nagao | Michael McCord | Arendse Bernth
Proceedings of the COLING-2000 Workshop on Semantic Annotation and Intelligent Content

1998

pdf bib
The LMT Transformational System
Michael McCord | Arendse Bernth
Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers

We present a newly designed transformational system for the MT system LMT, consisting of a transformational formalism, LMT-TL, and an algorithm for applying transformations written in this formalism. LMT-TL is both expressive and simple because of the systematic use of a powerful pattern matching mechanism that focuses on dependency trees. LMT-TL is a language in its own right, with no “escapes” to underlying programming languages. We first provide an overview of the complete LMT translation process (all newly redesigned), and then give a self-contained description of LMT-TL, with examples.

pdf bib
LMT at Tivoli Gardens
Arendse Bernth | Michael McCord
Proceedings of the 11th Nordic Conference of Computational Linguistics (NODALIDA 1998)

1993

pdf bib
Heuristics for Broad-Coverage Natural Language Parsing
Michael C. McCord
Human Language Technology: Proceedings of a Workshop Held at Plainsboro, New Jersey, March 21-24, 1993

1991

pdf bib
Advances in Machine Translation Research in IBM
Mori Rimon | Pilar Martinez | Michael McCord | Ulrike Schwall
Proceedings of Machine Translation Summit III: Papers

IBM is engaged in advanced research and development projects on various aspects of machine translation, between several language pairs. The activities reported on hero are all parts of a rather large-scale, international effort, following Michael McCord’s LMT approach. The paper focuses on seven selected topics: recent enhancements made in the Slot Grammar formalism and the specific analysis components; specification of a semantic type hierarchy and its use for verb sense disambiguation; incorporation of statistical techniques in the translation process; anaphora resolution; linkage of target morphology modules; methods for the construction of large MT lexicons; and interactive disambiguation.

1990

pdf bib
A Syntactic Filter on Pronominal Anaphora for Slot Grammar
Shalom Lappin | Michael McCord
28th Annual Meeting of the Association for Computational Linguistics

pdf bib
Anaphora Resolution in Slot Grammar
Shalom Lappin | Michael McCord
Computational Linguistics, Volume 16, Number 4, December 1990

1989

pdf bib
Design of LMT: A Prolog-Based Machine Translation System
Michael C. McCord
Computational Linguistics, Volume 15, Number 1, March 1989

pdf bib
LMT
Michael McCord
Proceedings of Machine Translation Summit II

1985

bib
LMT: a Prolog-Based Machine Translation System
Michael McCord
Proceedings of the first Conference on Theoretical and Methodological Issues in Machine Translation of Natural Languages

pdf bib
Modular Logic Grammars
Michael C. McCord
23rd Annual Meeting of the Association for Computational Linguistics

1983

pdf bib
Treating Coordination in Logic Grammars
Veronica Dahl | Michael C. McCord
American Journal of Computational Linguistics, Volume 9, Number 2, April-June 1983

1980

pdf bib
Slot Grammars
Michael C. McCord
American Journal of Computational Linguistics, Volume 6, Number 1, January-March 1980