284 search results - page 12 / 57 » Efficient Parsing for French |
ACL
1998
15 years 1 months ago
1998
This paper presents a new model for word alignments between parallel sentences, which allows one to accurately estimate different parameters, in a computationally efficient way. A...
DL
1998
Springer
15 years 4 months ago
1998
Springer
When a digital library is decomposed into many geographically distributed repositories,searchefficiencybecomesan issue. Increasing network congestion makes this a compelling issue...
101
click to vote
DEXA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The parsing schemata formalism allows us to describe parsing algorithms in a simple, declarative way by capturing their fundamenntics while abstracting low-level detail. ...
59
Voted
ACL
2000
15 years 1 months ago
2000
In terms of both speed and memory consumption, graph unification remains the most expensive component of unification-based grammar parsing. We present a technique to reduce the me...
ACL
1990
15 years 27 days ago
1990
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...