The run-time context domain has much effect on the performance of practical corpus-based applications. Previous smoothing techniques, and class-based and similarity-based models cannot handle the dynamic status perfectly. In this paper, an adaptive learning algorithm is proposed for task adaptation to fit best the run-time context domain in the application of Chinese homophone disambiguation. I...

I want increased confidence in my programs. I want my own and other people’s programs to be more readable. I want a new discipline of programming that augments my thought processes. Therefore, I create and explore a new discipline of programming in my BabyUML laboratory. I select, simplify and twist UML and other languages to demonstrate how they help bridge the gap between me as a programmer a...

Transcription typing is one of the basic visual-motor control tasks with practical importance. Brain imaging studies (fMRI and PET) have discovered 2 phenomena related to transcription typing, involving different activation patterns of brain areas. In behavioral studies, Salthouse (1986) summarized 29 quantitative behavioral phenomena of transcription typing, 19 of which were modeled by TYPIST ...

This paper presents a pronoun resolution algor i thm that adheres to the constraints and rules of Centering Theory (Grosz et al., 1995) and is an alternative to Brennan et al.'s 1987 algori thm. The advantages of this new model, the Left-Right Centering Algorithm (LRC), lie in its incremental processing of utterances and in its low computat ional overhead. The algorithm is compared with three o...

Gerçek dünya problemlerine bak?ld???nda ço?unun birden fazla hedefi gerçekle?tirmeye yönelik oldu?u görülmektedir. Bu problemlerin çözümü için kullan?lan birçok klasik yöntem mevcuttur. Klasik yöntemlerin çözüm geli?tirme noktas?nda farkl? sebeplerden dolay? eksik kalmas? ara?t?rmac?lar? yakla??mlar geli?tirmeye yöneltmi?tir. Genellikle do?ada sürü halinde ya?ayan hayvanlar?n veya ya?am alanlar...

The parsing problem for a rb i t r a ry un i f icat ion grammars is unsolvable We present a class of un i f i ca t ion grammars for whcih the parsing problem is solvable and a para l le l parsing algori thm for th is class of grammars 1. In t roduc t ion Uni f icat ion grammars have the power of a Turing machine, and one can easily prove this by showing that a un i f i ca t ion grammar can simu...

We are writing to answer the enquiry from Professor Somsri Wiwanitkit and Professor Viroj Wiwanitkit about the findings of our study. We could not agree more that clothing does play an important role in affecting the post mortem changes of corpses. One of the major effects include retaining body heat right after death (in other words, algor mortis), which in turn will enhance faster onset of pu...

In the past decade, Al research has created impor tant technologies. The annual investment in , ant return f rom, the several thousand existing systems employ ing Al technology is in the hundreds of mi l l ions of dollars. ... One feature these successful programs have in common is that they work in well-defined domains in which the systems i n fo rmat ion , or knowledge base ( K B ) , is not e...