411 search results - page 16 / 83 » Automating the Dependency Pair Method |
PLILP
1994
Springer
14 years 1 months ago
1994
Springer
Abstract. Program slicing is a useful technique for debugging, testing, and analyzing programs. A program slice consists of the parts of a program which (potentially) affect the va...
SOFSEM
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
ACL
2007
13 years 11 months ago
2007
Most current machine transliteration systems employ a corpus of known sourcetarget word pairs to train their system, and typically evaluate their systems on a similar corpus. In t...
SIGIR
2005
ACM
14 years 3 months ago
2005
ACM
State-of-the-art question answering (QA) systems employ termdensity ranking to retrieve answer passages. Such methods often retrieve incorrect passages as relationships among ques...
ACL
1996
13 years 11 months ago
1996
This paper describes a new statistical parser which is based on probabilities of dependencies between head-words in the parse tree. Standard bigram probability estimation techniqu...