We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...
This paper describes a research effort to support collaborative translation by monolingual speakers, or people that speak only the source or target language. I hypothesize that sh...
Natural Language Processing (NLP) for Information Retrieval has always been an interesting and challenging research area. Despite the high expectations, most of the results indica...
Question answering systems are complex systems using natural language processing. Some evaluation campaigns are organized to evaluate such systems in order to propose a classifica...
A crucial step toward the goal of automatic extraction of propositional information from natural language text is the identification of semantic relations between constituents in ...