Representation and stochastic resolution of ambiguity in constraint based parsing = Darstellung und stochastische Auflösung vom Ambiguität in constraint-basiertem Parsing

No abstract is available for this paper.

• Publication year

  1999

• Venue

  Unknown venue

• Publication date

  Unknown publication date

• Fields of study

  Not labeled

• Identifiers
  DOI 10.18419/OPUS-2444
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Elements of Information Theory

  2005cited by this paper
• Categorical Data Analysis

  2003cited by this paper
• A grammar writer's cookbook

  1999cited by this paper
• Estimators for Stochastic “Unification-Based” Grammars

  1999cited by this paper
• Optimality theory style constraint ranking in large-scale LFG grammars

  1998cited by this paper
• Machine Translation with a Stochastic Grammatical Channel

  1998cited by this paper
• Parsing Inside-Out

  1998cited by this paper
• Edge-Based Best-First Chart Parsing

  1998cited by this paper
• Corpus-Based Word Sense Disambiguation

  1998cited by this paper
• IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 20, NO. 7, JULY 1998 Comments on "Geodesic Saliency of

  1998cited by this paper
• A DP based Search Algorithm for Statistical Machine Translation

  1998cited by this paper
• Statistical Models for Co-occurrence Data

  1998cited by this paper
• Exploiting Syntactic Structure for Language Modeling

  1998cited by this paper
• Valence Induction with a Head-Lexicalized PCFG

  1998cited by this paper
• Consistency of Stochastic Context-Free Grammars From Probabilistic Estimation Based on Growth Transformations

  1997cited by this paper
• Aggregate and mixed-order Markov models for statistical language processing

  1997cited by this paper
• The Linguist's Guide to Statistics - Don't Panic

  1997cited by this paper
• Similarity-Based Approaches to Natural Language Processing

  1997cited by this paper
• Incremental Finite-State Parsing

  1997cited by this paper
• Independence Assumptions Considered Harmful

  1997cited by this paper
• Efficient Construction of Underspecified Semantics under Massive Ambiguity

  1997cited by this paper
• Statistical methods for speech recognition

  1997cited by this paper
• Probabilistic Constraint Logic Programming

  1997cited by this paper
• Ambiguity resolution in language learning - computational and cognitive models

  1997cited by this paper
• Three Generative, Lexicalised Models for Statistical Parsing

  1997cited by this paper
• A New Statistical Parser Based on Bigram Lexical Dependencies

  1996cited by this paper
• Learning probabilistic grammars for language modeling

  1996cited by this paper
• Stochastic Attribute-Value Grammars

  1996cited by this paper
• A Maximum Entropy Approach to Natural Language Processing

  1996cited by this paper
• Introduction to algorithms

  1996cited by this paper
• Three New Probabilistic Models for Dependency Parsing: An Exploration

  1996cited by this paper
• Parsing Algorithms and Metrics

  1996cited by this paper
• Relating Turing’s Formula and Zipf’s Law

  1996cited by this paper
• The EM algorithm and extensions

  1996cited by this paper
• Inducing Features of Random Fields

  1995cited by this paper
• Error-tolerant Finite-state Recognition with Applications to Morphological Analysis and Spelling Correction

  1995cited by this paper
• Memoization of Coroutined Constraints

  1995cited by this paper
• The Intersection of Finite State Automata and Definite Clause Grammars

  1995cited by this paper
• Parsing English with a Link Grammar

  1995cited by this paper
• Stochastic HPSG

  1995cited by this paper
• Book Reviews: Statistical Language Learning

  1995cited by this paper
• Image analysis, random fields and dynamic Monte Carlo methods: a mathematical introduction

  1995cited by this paper
• Two-dimensional clusters in grammatical relations

  1995cited by this paper
• A weighted average n-gram model of natural language

  1994cited by this paper
• Explorations in automatic thesaurus discovery

  1994cited by this paper
• Regular Models of Phonological Rule Systems

  1994cited by this paper
• Similarity-Based Estimation of Word Cooccurrence Probabilities

  1994cited by this paper
• Constructing Lexical Transducers

  1994cited by this paper
• The Core Language Engine

  1994cited by this paper
• RECOGNITION CAN BE HARDER THAN PARSING

  1994cited by this paper
• Residuation and Guarded Rules for Constraint Logic Programming

  1993cited by this paper
• The Interface between Phrasal and Functional Constraints

  1993cited by this paper
• Estimating 'small' probabilities by leaving-one-out

  1993cited by this paper
• The Mathematics of Statistical Machine Translation: Parameter Estimation

  1993cited by this paper
• CUF - A Formalism for Linguistic Knowledge Representation

  1993cited by this paper
• Cooccurrence smoothing for stochastic language modeling

  1992cited by this paper
• An Estimate of an Upper Bound for the Entropy of English

  1992cited by this paper
• Grammatical Trigrams: A Probabilistic Model of Link Grammar

  1992cited by this paper
• Parameter Estimation for Constrained Context-Free Language Models

  1992cited by this paper
• Word Space

  1992cited by this paper
• Using Disjunctive Constraints in a Bottom-Up Parser

  1992cited by this paper
• Learn-ing probaballstic dependency grammars from labelled text

  1992cited by this paper
• Class-Based n-gram Models of Natural Language

  1992cited by this paper
• Inside-Outside Reestimation From Partially Bracketed Corpora

  1992cited by this paper
• Dimensions of meaning

  1992cited by this paper
• A Procedure for Quantitatively Comparing the Syntactic Coverage of English Grammars

  1991cited by this paper
• Structural Ambiguity and Lexical Relations

  1991cited by this paper
• Constraint Projection: An Efficient Treatment of Disjunctive Feature Descriptions

  1991cited by this paper
• Probabilistic reasoning in intelligent systems: Networks of plausible inference

  1991cited by this paper
• Memory requirements and local ambiguities of parsing strategies

  1991cited by this paper
• A comparison of the enhanced Good-Turing and deleted estimation methods for estimating probabilities of English bigrams

  1991cited by this paper
• Sentence Processing as Constraint Transformation

  1990cited by this paper
• A Cache-Based Natural Language Model for Speech Recognition

  1990cited by this paper
• Feature Logic with Disjunctive Unification

  1990cited by this paper
• Information-based syntax and semantics. Volume I: Fundamentals: Carl Pollard and Ivan A. Sag, (CSLI Lecture Notes Series No. 13). Stanford, CA: Centre for the Study of Language and Information. 1987. x+233 pp.

  1990cited by this paper
• Introduction to WordNet: An On-line Lexical Database

  1990cited by this paper
• A Spelling Correction Program Based on a Noisy Channel Model

  1990cited by this paper
• Disjunctive Unification

  1990cited by this paper
• An Overview of Disjunctive Constraint Satisfaction

  1989cited by this paper
• The Structure of Shared Forests in Ambiguous Parsing

  1989cited by this paper
• JPSG Parser on Constraint Logic Programming

  1989cited by this paper
• Stochastic Complexity in Statistical Inquiry

  1989cited by this paper
• Unification: a multidisciplinary survey

  1989cited by this paper
• Determining Consistency of Feature Terms with Distributed Disjunctions

  1989cited by this paper
• Deenite Relations over Constraint Languages

  1988cited by this paper
• A Feature Logic with Subsorts

  1988cited by this paper
• Estimation of probabilities from sparse data for the language model component of a speech recognizer

  1987cited by this paper
• Construction of Logic Programs Based on Generalized Unfold/Fold Rules

  1987cited by this paper
• Word Order and Constituent Structure in German

  1987cited by this paper
• A Unification Method for Disjunctive Feature Descriptions

  1987cited by this paper
• A Logical Semantics for Feature Structures

  1986cited by this paper
• A Learning Algorithm for Boltzmann Machines

  1985cited by this paper
• On Turing's formula for word probabilities

  1985cited by this paper
• Unfold/Fold Transformation of Logic Programs

  1984cited by this paper
• A lattice theoretic approach to computation based on a calculus of partially ordered type structures (property inheritance, semantic nets, graph unification)

  1984cited by this paper
• Features and Values

  1984cited by this paper
• A General Computational Model for Word-Form Recognition and Production

  1984cited by this paper
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images

  1984cited by this paper
• Estimation of probabilities in the language model of the IBM speech recognition system

  1984cited by this paper
• Cluster analysis for researchers

  1984cited by this paper

• The Statistics of Word Cooccur-rences: Word Pairs and Collocations

  2004cites this paper
• Automatic F{structure Annotation of Treebank Trees Automatic F{structure Annotation of Treebank Trees 1

  2000influential citation
• From parallel grammar development towards machine translation – a project overview

  1999cites this paper
• Writing Large-Scale Parallel Grammars For English, French, And German

  1999cites this paper