11740 search results - page 11 / 2348 » More Problems in Rewriting |
SIGIR
2002
ACM
13 years 7 months ago
2002
ACM
This paper describes a question answering system that is designed to capitalize on the tremendous amount of data that is now available online. Most question answering systems use ...
CP
1999
Springer
13 years 11 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
RTA
1995
Springer
13 years 11 months ago
1995
Springer
NAACL
2001
13 years 9 months ago
2001
Using finite-state automata for the text analysis component in a text-to-speech system is problematic in several respects: the rewrite rules from which the automata are compiled a...
LPAR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...