Amanote Research

Amanote Research

    RegisterSign In

Minimal-Length Linearizations for Mildly Context-Sensitive Dependency Trees

doi 10.3115/1620754.1620803
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2009

Authors
Y. Albert ParkRoger Levy
Publisher

Association for Computational Linguistics


Related search

Random Minimal Trees

Biometrika
StatisticsProbabilityUncertaintyApplied MathematicsBiological SciencesAgriculturalMathematics
1968English

Computation of Minimal Length Full Steiner Trees on the Vertices of a Convex Polygon

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1969English

Minimal Trees and Monophonic Convexity

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2012English

Minimal Mutation Trees of Sequences

SIAM Journal on Applied Mathematics
Applied Mathematics
1975English

The Minimal Dependency Relation for Causal Event Ordering in Distributed Computing

Applied Mathematics and Information Sciences
Numerical AnalysisApplied MathematicsAnalysisComputer Science ApplicationsMathematicsComputational Theory
2015English

Minimal Length Test Vectors for Multiple-Fault Detection

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2004English

Minimal 2-Dominating Sets in Trees

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
2013English

Context-Sensitive Visualization

2017English

Approach to Context Computation for Implicit Context-Sensitive Graph Grammars

2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy