10493 search results - page 455 / 2099 » Dynamic Word Problems |
164
click to vote
ICAI
2003
15 years 8 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
184
click to vote
SMC
2007
IEEE
16 years 1 months ago
2007
IEEE
— Semantic relatedness between words or concepts is a fundamental problem in many applications of computational linguistics and artificial intelligence. In this paper, a new mea...
170
click to vote
CICLING
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. With the current method of query formation, a Question Answering system retrieves a set of documents that are similar to a question, while what is mostly required is a se...
174
click to vote
AI
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Term extraction is an important problem in natural language processing. In this paper, we propose a language independent statistical corpus-based term extraction algorith...
169
click to vote
ASSISTIVE
1998
Springer
15 years 11 months ago
1998
Springer
In this paper, wepresent a prototype MTsystem named SYUWANwhich can translate Japanese into Japanesesign language. Oneof the most important problemsin this translation is that the...