2005
DOI: 10.1007/11424574_11
|View full text |Cite
|
Sign up to set email alerts
|

An Exploratory Application of Constraint Optimization in Mozart to Probabilistic Natural Language Processing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2007
2007
2009
2009

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 2 publications
0
4
0
Order By: Relevance
“…(We will return to this point at various places in this paper.) Constraints are particularly well-suited for addressing problems that involve interactions between information of different types, granularity and levels of specification (see Langkilde-Geary, 2004). …”
Section: Constraints In Generation: Motivation Limitations and Complmentioning
confidence: 99%
“…(We will return to this point at various places in this paper.) Constraints are particularly well-suited for addressing problems that involve interactions between information of different types, granularity and levels of specification (see Langkilde-Geary, 2004). …”
Section: Constraints In Generation: Motivation Limitations and Complmentioning
confidence: 99%
“…We previously implemented an exploratory prototype that used raw frequencies instead of smoothed probabilities for the feature costs and search heuristic confidences. (Langkilde-Geary, 2005;Langkilde-Geary, 2007). The lack of smoothing severely limited the applicability of the prototype.…”
Section: Methodsmentioning
confidence: 99%
“…There are essentially three approaches to trainable surface realization: two-stage surface realizers [8,9,10], classification-based surface realizers [11,12], and surface realizers that use probabilistic grammars [13,14,15,16]. Each type of surface realizer uses a statistical model or set of models that capture word order and syntactic constraints (e.g.…”
Section: Related Workmentioning
confidence: 99%