Sciweavers

621 search results - page 25 / 125
» Parsing As Tree Traversal
Sort
View
ACL
2009
13 years 7 months ago
A Polynomial-Time Parsing Algorithm for TT-MCTAG
This paper investigates the class of TreeTuple MCTAG with Shared Nodes, TTMCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language proc...
Laura Kallmeyer, Giorgio Satta
LREC
2010
154views Education» more  LREC 2010»
13 years 11 months ago
Statistical French Dependency Parsing: Treebank Conversion and First Results
We first describe the automatic conversion of the French Treebank (Abeill
Marie Candito, Benoît Crabbé, Pascal ...
DEXA
2007
Springer
126views Database» more  DEXA 2007»
14 years 1 months ago
Compiling Declarative Specifications of Parsing Algorithms
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. ...
Carlos Gómez-Rodríguez, Jesús...
ACL
1990
13 years 11 months ago
Licensing and Tree Adjoining Grammar in Government Binding Parsing
This paper presents an implemented, psychologicallyplausible parsing model for Government Binding theory grammars. I make use of two main ideas: (1) a generalization of the licens...
Robert Frank
ICDS
2007
IEEE
14 years 4 months ago
Automatic Acquisition of Translation Knowledge Using Structural Matching Between Parse Trees
— In this paper we present a rule-based formalism for the representation, acquisition, and application of translation knowledge. The formalism is being used successfully in a Jap...
Werner Winiwarter