Sciweavers

284 search results - page 14 / 57
» Efficient Parsing for French
Sort
View
ANLP
2000
124views more  ANLP 2000»
13 years 10 months ago
A Divide-and-Conquer Strategy for Shallow Parsing of German Free Texts
We present a divide-and-conquer strategy based on finite state technology for shallow parsing of realworld German texts. In a first phase only the topological structure of a sente...
Günter Neumann, Christian Braun, Jakub Piskor...
COLING
2010
13 years 3 months ago
Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems
This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with context-summ...
Laura Kallmeyer, Wolfgang Maier
ACL
1998
13 years 10 months ago
Translating a Unification Grammar with Disjunctions into Logical Constraints
This paper proposes a method for generating a logicalconstraint-based internal representation from a unification grammar formalism with disjunctive information. Unification gramma...
Mikio Nakano, Akira Shimazu
ICDAR
1995
IEEE
14 years 4 days ago
Efficient analysis of complex diagrams using constraint-based parsing
This paper describes substantial advances in the analysis (parsing) of diagrams using constraint grammars. The addition of set types to the grammar and spatial indexing of the dat...
Robert P. Futrelle, Nikos Nikolakis
ECML
2006
Springer
14 years 8 days ago
Efficient Convolution Kernels for Dependency and Constituent Syntactic Trees
In this paper, we provide a study on the use of tree kernels to encode syntactic parsing information in natural language learning. In particular, we propose a new convolution kerne...
Alessandro Moschitti