284 search results - page 22 / 57 » Efficient Parsing for French |
AI
2009
Springer
14 years 20 days ago
2009
Springer
Abstract. A top-down parsing algorithm has been constructed to accommodate any form of ambiguous context-free grammar, augmented with semantic rules with arbitrary attribute depend...
EACL
2009
ACL Anthology
14 years 9 months ago
2009
ACL Anthology
We present a unified view of many translation algorithms that synthesizes work on deductive parsing, semiring parsing, and efficient approximate search algorithms. This gives rise...
FINTAL
2006
14 years 9 days ago
2006
We present a regular approximation of Link Grammar, a dependency-type formalism with context-free expressive power, as a first step toward a finite-state joint inference system. Th...
POPL
2010
ACM
14 years 6 months ago
2010
ACM
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
CLEF
2003
Springer
14 years 1 months ago
2003
Springer
: The basic line of our action is first to use natural language processing to prune the texts and the query, and secondly to use an ontology to expand the queries. Last year The sy...