411 search results - page 16 / 83 » Automating the Dependency Pair Method |
182
click to vote
PLILP
1994
Springer
15 years 9 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...
143
click to vote
SOFSEM
2007
Springer
15 years 11 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...
126
click to vote
ACL
2007
15 years 6 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...
161
click to vote
SIGIR
2005
ACM
15 years 11 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...
150
Voted
ACL
1996
15 years 6 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...