284 search results - page 4 / 57 » Efficient Parsing for French |
GRAMMARS
2000
13 years 5 months ago
2000
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
LREC
2008
2008
Building a Bilingual Representation of the Roget Thesaurus for French to English Machine Translation
13 years 7 months ago
This paper describes a solution to lexical transfer as a trade-off between a dictionary and an ontology. It shows its association to a translation tool based on morpho-syntactical...
NAACL
2010
13 years 3 months ago
2010
We describe a synchronous parsing algorithm that is based on two successive monolingual parses of an input sentence pair. Although the worst-case complexity of this algorithm is a...
ACL
1996
13 years 6 months ago
1996
Under categorial grammars that have powerful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is inefficient and obscures...
ECML
2007
Springer
13 years 11 months ago
2007
Springer
Action-based dependency parsing, also known as deterministic dependency parsing, has often been regarded as a time efficient parsing algorithm while its parsing accuracy is a littl...