Sciweavers

838 search results - page 111 / 168
» From Natural Language to Formal Proof Goal
Sort
View
EACL
1993
ACL Anthology
15 years 7 months ago
Resolving Zero Anaphora in Japanese
The paper presents a computational theory for resolving Japanese zero anaphora, based on the notion of discourse segment. We see that the discourse segment reduces the domain of a...
Tadashi Nomoto, Yoshihiko Nitta
CICLING
2006
Springer
15 years 10 months ago
Automatic Acquisition of Semantic-Based Question Reformulations for Question Answering
Abstract. In this paper, we present a method for the automatic acquisition of semantic-based reformulations from natural language questions. Our goal is to find useful and generic ...
Jamileh Yousefi, Leila Kosseim
WWW
2005
ACM
16 years 6 months ago
XJ: facilitating XML processing in Java
The increased importance of XML as a data representation format has led to several proposals for facilitating the development of applications that operate on XML data. These propo...
Matthew Harren, Mukund Raghavachari, Oded Shmueli,...
CICLING
2009
Springer
16 years 6 months ago
Guessers for Finite-State Transducer Lexicons
Abstract. Language software applications encounter new words, e.g., acronyms, technical terminology, names or compounds of such words. In order to add new words to a lexicon, we ne...
Krister Lindén
SAS
2007
Springer
126views Formal Methods» more  SAS 2007»
16 years 7 days ago
Hierarchical Pointer Analysis for Distributed Programs
We present a new pointer analysis for use in shared memory programs running on hierarchical parallel machines. The analysis is motivated by the partitioned global address space lan...
Amir Kamil, Katherine A. Yelick