Htl0708:c/Wikipedia

From EnWiki

Jump to: navigation, search

Contents

Martin Kay

Martin Kay has been described as a leader in computational linguistics since 1950 to present [[1]]. His works show a new field of scientific research and development.

http://paginaspersonales.deusto.es/abaitua/kanpetzu/pics/martinkay.gif

Biography

Prof. Martin Kay is a computer scientist known for his work in computational linguistics at Standford U. and Honorary Professor at Saarland U. He was born and grew up in Great Britain. He received his M.A. from Trinity College, Cambridge, in 1961. In 1958 he started to work at the Cambridge Language Research Unit. Kay is one of the pioneers of computational linguistics and machine translation. He was responsible for introducing the notion of chart parsing in computational linguistics, and the notion of unification in linguistics generally.

With Ron Kaplan, he pioneered research and application development in finite-state morphology. He has been a longtime contributor to, and critic of, work on machine translation. In 1961 he moved to the Rand Corporation in Santa Monica, California, where he became head of research in linguistics and machine translation.

In his seminal paper "The Proper Place of Men and Machines in Language Translation", Kay argued for MT systems that were integrated in the human translation process. He was reviewer and critic of EUROTRA, Verbmobil, and many other MT projects. Kay is former Chair of the Association of Computational Linguistics and ungoing Chair of the International Committee on Computational Linguistics.

He left Rand in 1972 to become Chair of the Department of Computer Science at the University of California, Irvine. In 1974 he moved to the Xerox Palo Alto Research Center as a Research Fellow. In 1985, while retaining his position at Xerox PARC, he joined the faculty of Stanford University half-time. He is currently Professor of Linguistics at Stanford University and Honorary Professor of Computational Linguistics at Saarland University.

His achievements include the development of chart parsing and functional unification grammar and major contributions to the application of finite state automata in computational phonology and morphology. He is also regarded as a leading authority on machine translation.

His honors include an honorary Doctor of Philosophy from Gothenburg University and the 2005 Association for Computational Linguistics' Lifetime Achievement Award. He is the permanent chairman of the International Committee on Computational Linguistic.

[2] [3]

Publications

  • 2005

EE Martin Kay: A Life of Language. Computational Linguistics 31(4): 425-438 (2005)

  • 2004

EE Martin Kay: Substring Alignment Using Suffix Trees. CICLing 2004: 275-282

  • 1997

EE Martin Kay: The Proper Place of Men and Machines in Language Translation. Machine Translation 12(1-2): 3-23 (1997) EE Martin Kay: It's Still the Proper Place. Machine Translation 12(1-2): 35-38 (1997)

  • 1996

Martin Kay: Chart Generation. ACL 1996: 200-204

  • 1994

Mark Johnson, Martin Kay: Parsing and Empty Nodes. Computational Linguistics 20(2): 289-300 (1994) Ronald M. Kaplan, Martin Kay: Regular Models of Phonological Rule Systems. Computational Linguistics 20(3): 331-378 (1994)

  • 1993

Martin Kay, Martin Röscheisen: Text-Translation Alignment. Computational Linguistics 19(1): 121-142 (1993)

  • 1992

EE Martin Kay: Ongoing directions in Computational Linguistics. COLING 1992

  • 1990

EE Mark Johnson, Martin Kay: Semantic Abstraction and Anaphora. COLING 1990: 17-27

  • 1987

EE Martin Kay: Nonconcatenative Finite-State Morphology. EACL 1987: 2-10

  • 1985

Lauri Karttunen, Martin Kay: Structure Sharing with Binary Trees. ACL 1985: 133-136

  • 1984

EE Martin Kay: The Dictionary Server. COLING 1984: 461- EE Martin Kay: Functional Unification Grammar: A Formalism For Machine Translation. COLING 1984: 75-78 Martin Kay: Unification in Grammar. Natural Language Understanding and Natural Language Understanding Workshop 1984: 233-240

  • 1982

Martin Kay: Machine Translation. American Journal of Computational Linguistics 8(2): 74-78 (1982)

  • 1979

EE Martin Kay: Syntactic Process. ACL 1979

  • 1977

Daniel G. Bobrow, Ronald M. Kaplan, Martin Kay, Donald A. Norman, Henry S. Thompson, Terry Winograd: GUS, A Frame-Driven Dialog System. Artif. Intell. 8(2): 155-173 (1977)

  • 1974

Robert Balzer, Norton Greenfeld, Martin Kay, William Mann, Walter Ryder, David Wilczynski, Albert L. Zobrist: Domain-Independent Automatic Programming. IFIP Congress 1974: 326-330

  • 1962

Martin Kay: Rules of Interpretation - An Approach to the Problem of Computation in the Semantics of Natural Language. IFIP Congress 1962: 318-322 [4]

Research Centres

  • Stanford Department of Linguistics
  • Palo Alto Research Centre
  • Hewlett-Packard

Relevant articles

  • Regular models of phonological rule systems

This paper presents a set of mathematical and computational tools for manipulating and reasoning about regular languages and regular relations and argues that they provide a solid basis for computational phonology. It shows in detail how this framework applies to ordered sets of context-sensitive rewriting rules and also to grammars in Koskenniemi's two-level formalism. This analysis provides a common representation of phonological constraints that supports efficient generation and recognition by a single simple interpreter.

[5]


  • Text-translation alignment

The authors present an algorithm for aligning texts with their translations that is based only on internal evidence. The relaxation process rests on a notion of which word in one text corresponds to which word in the other text that is essentially based on the similarity of their distributions. It exploits a partial alignment of the word level to induce a maximum likelihood alignment of the sentence level, which is in turn used, in the next iteration, to refine the word level estimate. The algorithm appears to converge to the correct sentence alignment in only a few iterations. [6]


  • A logical version of functional grammar

Kay's functional-unification grammar notation is a way of expressing grammars which relies on very few primitive notions. The primary syntactic structure is the feature structure, which can be visualised as a directed graph with arcs labeled by attributes of a constituent, and the primary structure-building operation is unification. In this paper we propose a mathematical formulation of FUG, using logic to give a precise account of the strings and the structures defined by any grammar written in this notation. [7]

References

  • A logical version of functional grammar. Portal. Nieves Taranco, 2008. Retrieved: 28 April 2008 12:23

http://portal.acm.org/citation.cfm?id=981175.981188&coll=GUIDE&dl=

  • Machine translation: the dissapointing past and present. Anne Zaenen, 1996. Retrived: 14 May 2008 12:15

http://cslu.cse.ogi.edu/HLTsurvey/ch8node2.html

Further References

Retrieved from "http://littera.deusto.es/enwiki/index.php/Htl0708:c/Wikipedia"
Personal tools