Amanote Research

Amanote Research

    RegisterSign In

A Divide-And-Conquer Strategy for Shallow Parsing of German Free Texts

doi 10.3115/974147.974180
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2000

Authors
Günter NeumannChristian BraunJakub Piskorski
Publisher

Association for Computational Linguistics


Related search

Divide-And-Conquer Algorithms for Multiprocessors

English

Divide and Conquer

1993English

Divide and Conquer

2018English

A Divide-And-Conquer Method for the Takagi Factorization

SIAM Journal on Matrix Analysis and Applications
Analysis
2008English

Divide and Conquer Roadmap for Algebraic Sets

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2014English

Kart: A Divide-And-Conquer Algorithm for NGS Read Alignment

Bioinformatics
StatisticsProbabilityMolecular BiologyBiochemistryComputational TheoryComputer Science ApplicationsMathematicsComputational Mathematics
2017English

Practical Divide-And-Conquer Algorithms for Polynomial Arithmetic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Adaptive History Compression for Learning to Divide and Conquer

English

A "Divide and Conquer" Strategy Based on Situations to Achieve Reactive Collision Avoidance in Troublesome Scenarios

2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy