ebooksgratis.com

See also ebooksgratis.com: no banners, no cookies, totally FREE.

CLASSICISTRANIERI HOME PAGE - YOUTUBE CHANNEL
Privacy Policy Cookie Policy Terms and Conditions
Yorick Wilks - Wikipedia, the free encyclopedia

Yorick Wilks

From Wikipedia, the free encyclopedia

Yorick Wilks

Born 1939
Flag of the United Kingdom United Kingdom
Fields Natural language processing
Institutions University of Sheffield, University of Oxford
Alma mater University of Cambridge
Known for Artificial intelligence

Yorick Wilks (born 1939) is a British Computer Scientist who is Professor of Artificial Intelligence at the University of Sheffield, and a Senior Research Fellow at the Oxford Internet Institute.

Contents

[edit] Biography

Wilks was educated at Pembroke College, Cambridge and was an early pioneer in meaning-based approaches to the understanding of natural language content by computers. His main early contribution in the 1960s was called "Preference Semantics" (Wilks, Y., 1973; Wilks, Y. and Fass, D, 1992; and [1] below.), an algorithmic method for assigning the "most coherent" interpretation to a sentence in terms of having the maximum number of internal preferences of its parts (normally verbs or adjectives) satisfied. That early work was hand-coded with semantic entries (of the order of some hundreds) as was normal at the time, but since then has led to the empirical determinations of preferences (chiefly of English verbs) by Resnik, Grishman, Lehnert and others in the 1980s and 1990s (e.g. Resnik, P., 1997). A key component of the notion of preference in semantics was that the interpretation of an utterance is not a well- or ill-formed notion, as was argued in Chomskyan approaches, such as those of Fodor and Katz. it was rather that a semantic interpretation was the best available, even though some preferences might not be satisfied. So, in "The machine answered the question with a low whine" the agent of "answer" does not satisfy that verb's preference for a human answerer--which would cause it to be deemed ill-formed by Fodor and Katz--but is accepted as sub-optimal or metaphorical, and now, of course, conventional. The function of the algorithm is not to determine well-formedness at all but to make the optimal selection of word-senses to participate in the overall interpretation. Thus, in "The Pole answered..." the system will always select the human sense of the agent and not the inanimate one if it gives a better more coherent interpretation overall. Preference Semantics is thus some of the earliest computational work--with programs run at Systems Development Corporation in Santa Monica in 1967 in LISP on an IBM360--in the now established field of word sense disambiguation.

This approach was used in the first operational machine translation system based principally on meaning structures and built by Wilks at Stanford Artificial Intelligence Laboratory in the early 1970s (Wilks, Y., 1973) at the same time and place as Roger Schank was applying his Conceptual Dependency approach to machine translation. The LISP code of Wilks' system was in the The Computer Museum, Boston. Essays discussing aspects of his work throughout his life can be found at ([2], Ahmad, K., Brewster, C., Stevenson, M. (eds.) (2007)). He has been elected a Fellow of the American and European Associations for Artificial Intelligence, of the British Computer Society, and a member of the UK Computing Research Committee. He is Professor of Artificial Intelligence at the [University of Sheffield] and a Senior Research fellow at the Oxford Internet Institute. He became interested in problems of modelling human-computer dialogue in the 1990s and he led a team that won the Loebner Competition in 1997. He is currently the Director of the EU funded Companions Project on creating long-term computer companions for people.

Yorick Wilks was awarded the Antonio Zampolli prize in honor of his lifetime work at the LREC'2008 conference on May 28, 2008.

[edit] Selected works

  • Ballim, A., Wilks, Y. (1991) Artificial Believers: The Ascription of Belief. Lawrence Erlbaum Press.
  • Wilks, Y., Fass, D. (1992) Preference Semantics: a family history. In Computing and Mathematics with Applications, Vol. 23, No. 2. A shorter version in the second edition of the Encyclopedia of Artificial Intelligence, (ed.) S. Shapiro. pp.1183-1194.
  • Wilks, Y. (1973) Preference Semantics. In E. Keenan, (ed.) The Formal Semantics of Natural Language. Cambridge: Cambridge U. P.
  • Wilks, Y. (1967) Semantic Consistency in Text. Systems Development Corporation, Santa Monica, CA. Technical Memorandum SP-2238.
  • Wilks, Y. (1973) The Stanford Machine Translation and Understanding Project. In R. Rustin (ed.) Natural Language Processing, Algorithmics Press, New York. [see [1] below]

[edit] References

  • Resnik, P. (1997) Selectional Preference and Sense Disambiguation, In Proceedings of ACL Siglex Workshop on Tagging Text with Lexical Semantics, Why, What and How?, Washington, April 4-5, 1997.

[edit] External links


aa - ab - af - ak - als - am - an - ang - ar - arc - as - ast - av - ay - az - ba - bar - bat_smg - bcl - be - be_x_old - bg - bh - bi - bm - bn - bo - bpy - br - bs - bug - bxr - ca - cbk_zam - cdo - ce - ceb - ch - cho - chr - chy - co - cr - crh - cs - csb - cu - cv - cy - da - de - diq - dsb - dv - dz - ee - el - eml - en - eo - es - et - eu - ext - fa - ff - fi - fiu_vro - fj - fo - fr - frp - fur - fy - ga - gan - gd - gl - glk - gn - got - gu - gv - ha - hak - haw - he - hi - hif - ho - hr - hsb - ht - hu - hy - hz - ia - id - ie - ig - ii - ik - ilo - io - is - it - iu - ja - jbo - jv - ka - kaa - kab - kg - ki - kj - kk - kl - km - kn - ko - kr - ks - ksh - ku - kv - kw - ky - la - lad - lb - lbe - lg - li - lij - lmo - ln - lo - lt - lv - map_bms - mdf - mg - mh - mi - mk - ml - mn - mo - mr - mt - mus - my - myv - mzn - na - nah - nap - nds - nds_nl - ne - new - ng - nl - nn - no - nov - nrm - nv - ny - oc - om - or - os - pa - pag - pam - pap - pdc - pi - pih - pl - pms - ps - pt - qu - quality - rm - rmy - rn - ro - roa_rup - roa_tara - ru - rw - sa - sah - sc - scn - sco - sd - se - sg - sh - si - simple - sk - sl - sm - sn - so - sr - srn - ss - st - stq - su - sv - sw - szl - ta - te - tet - tg - th - ti - tk - tl - tlh - tn - to - tpi - tr - ts - tt - tum - tw - ty - udm - ug - uk - ur - uz - ve - vec - vi - vls - vo - wa - war - wo - wuu - xal - xh - yi - yo - za - zea - zh - zh_classical - zh_min_nan - zh_yue - zu -