Martin Kay


2014

pdf bib
Does a Computational Linguist have to be a Linguist?
Martin Kay
Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers

2012

pdf bib
The new machine translation: getting blood from a stone
Martin Kay
Proceedings of the Third International Workshop on Free/Open-Source Rule-Based Machine Translation

pdf bib
Suffix Trees as Language Models
Casey Redd Kennington | Martin Kay | Annemarie Friedrich
Proceedings of the Eighth International Conference on Language Resources and Evaluation (LREC'12)

Suffix trees are data structures that can be used to index a corpus. In this paper, we explore how some properties of suffix trees naturally provide the functionality of an n-gram language model with variable n. We explain these properties of suffix trees, which we leverage for our Suffix Tree Language Model (STLM) implementation and explain how a suffix tree implicitly contains the data needed for n-gram language modeling. We also discuss the kinds of smoothing techniques appropriate to such a model. We then show that our suffix-tree language model implementation is competitive when compared to the state-of-the-art language model SRILM (Stolke, 2002) in statistical machine translation experiments.

pdf bib
Proceedings of COLING 2012
Martin Kay | Christian Boitet
Proceedings of COLING 2012

pdf bib
Proceedings of COLING 2012: Posters
Martin Kay | Christian Boitet
Proceedings of COLING 2012: Posters

pdf bib
Proceedings of COLING 2012: Demonstration Papers
Martin Kay | Christian Boitet
Proceedings of COLING 2012: Demonstration Papers

2009

pdf bib
Intersecting Multilingual Data for Faster and Better Statistical Translations
Yu Chen | Martin Kay | Andreas Eisele
Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics

2008

pdf bib
Improving Statistical Machine Translation Efficiency by Triangulation
Yu Chen | Andreas Eisele | Martin Kay
Proceedings of the Sixth International Conference on Language Resources and Evaluation (LREC'08)

In current phrase-based Statistical Machine Translation systems, more training data is generally better than less. However, a larger data set eventually introduces a larger model that enlarges the search space for the decoder, and consequently requires more time and more resources to translate. This paper describes an attempt to reduce the model size by filtering out the less probable entries based on testing correlation using additional training data in an intermediate third language. The central idea behind the approach is triangulation, the process of incorporating multilingual knowledge in a single system, which eventually utilizes parallel corpora available in more than two languages. We conducted experiments using Europarl corpus to evaluate our approach. The reduction of the model size can be up to 70% while the translation quality is being preserved.

pdf bib
Hybrid machine translation architectures within and beyond the EuroMatrix project
Andreas Eisele | Christian Federmann | Hans Uszkoreit | Hervé Saint-Amand | Martin Kay | Michael Jellinghaus | Sabine Hunsicker | Teresa Herrmann | Yu Chen
Proceedings of the 12th Annual conference of the European Association for Machine Translation

2005

pdf bib
ACL Lifetime Achievement Award: A Life of Language
Martin Kay
Computational Linguistics, Volume 31, Number 4, December 2005

2004

pdf bib
Arabic Script-Based Languages Deserve to be Studied Linguistically
Martin Kay
Proceedings of the Workshop on Computational Approaches to Arabic Script-based Languages

2000

pdf bib
Guides and Oracles for Linear-Time Parsing
Martin Kay
Proceedings of the Sixth International Workshop on Parsing Technologies

If chart parsing is taken to include the process of reading out solutions one by one, then it has exponential complexity. The stratagem of separating read-out from chart construction can also be applied to other kinds of parser, in particular, to left-comer parsers that use early composition. When a limit is placed on the size of the stack in such a parser, it becomes context-free equivalent. However, it is not practical to profit directly from this observation because of the large state sets that are involved in otherwise ordinary situations. It may be possible to overcome these problems by means of a guide constructed from a weakened version of the initial grammar.

1999

pdf bib
Chart translation
Martin Kay
Proceedings of Machine Translation Summit VII

For efficiency reasons, Machine Translation systems are generally designed to eliminate ambiguities as early as possible even if delaying the decision would make a more informed choice possible. This paper takes the contrary view, arguing that essentially all choices should be deferred so that large numbers of competing translations will be produced in typical cases. Representing all the data structures in a suitable packed form, much as alternative structures are represented in a chart parser, makes this practicable.

1996

pdf bib
Chart Generation
Martin Kay
34th Annual Meeting of the Association for Computational Linguistics

1994

pdf bib
Parsing and empty nodes
Mark Johnson | Martin Kay
Computational Linguistics, Volume 20, Number 2, June 1994

pdf bib
Regular Models of Phonological Rule Systems
Ronald M. Kaplan | Martin Kay
Computational Linguistics, Volume 20, Number 3, September 1994

1993

pdf bib
Text-Translation Alignment
Martin Kay | Martin Roscheisen
Computational Linguistics, Volume 19, Number 1, March 1993, Special Issue on Using Large Corpora: I

1992

pdf bib
Ongoing directions in Computational Linguistics
Martin Kay
COLING 1992 Volume 1: The 14th International Conference on Computational Linguistics

1991

pdf bib
Monotonicity, Headedness, and Reversible Grammar
Martin Kay
Reversible Grammar in Natural Language Processing

pdf bib
Where Do Translators Fit Into MT?
Alex Gross | Claude Bedard | Harald Hille | Martin Kay | Frederick Klein | Sergei Nirenburg
Proceedings of Machine Translation Summit III: Panels

pdf bib
Proceedings of the Second International Workshop on Parsing Technologies (IWPT ’91)
Masaru Tomita | Martin Kay | Robert Berwick | Eva Hajicova | Aravind Joshi | Ronald Kaplan | Makoto Nagao | Yorick Wilks
Proceedings of the Second International Workshop on Parsing Technologies

February 13-25, 1991

1990

pdf bib
Semantic Abstraction and Anaphora
Mark Johnson | Martin Kay
COLING 1990 Volume 1: Papers presented to the 13th International Conference on Computational Linguistics

1989

pdf bib
Head-Driven Parsing
Martin Kay
Proceedings of the First International Workshop on Parsing Technologies

1987

pdf bib
Nonconcatenative Finite-State Morphology
Martin Kay
Third Conference of the European Chapter of the Association for Computational Linguistics

pdf bib
The Linguistic Connection
Martin Kay
Theoretical Issues in Natural Language Processing 3

pdf bib
Machines and People in Translation
Martin Kay
Proceedings of Machine Translation Summit I

pdf bib
Concluding Remarks
Martin Kay
Proceedings of Machine Translation Summit I

1986

pdf bib
Machine Translation will not Work
Martin Kay
24th Annual Meeting of the Association for Computational Linguistics

1984

pdf bib
Functional Unification Grammar: A Formalism for Machine Translation
Martin Kay
10th International Conference on Computational Linguistics and 22nd Annual Meeting of the Association for Computational Linguistics

pdf bib
The Dictionary Server
Martin Kay
10th International Conference on Computational Linguistics and 22nd Annual Meeting of the Association for Computational Linguistics

1982

pdf bib
Machine Translation
Martin Kay
American Journal of Computational Linguistics, Volume 8, Number 2, April-June 1982

1979

pdf bib
Syntactic Processing
Martin Kay
17th Annual Meeting of the Association for Computational Linguistics

1976

pdf bib
Abstracts of the 1976 International Conference on Computational Linguistics - COLING -

American Journal of Computational Linguistics (May 1976)

1975

pdf bib
Syntactic Processing and Functional Sentence Perspective
Martin Kay
Theoretical Issues in Natural Language Processing: Supplement

1973

pdf bib
Morphological Analysis
Martin Kay
COLING 1973 Volume 2: Computational And Mathematical Linguistics: Proceedings of the International Conference on Computational Linguistics

1967

pdf bib
Experiments With a Powerful Parser
Martin Kay
COLING 1967 Volume 1: Conference Internationale Sur Le Traitement Automatique Des Langues