WEIGHTED AUTOMATA: Related Papers in ACL Anthology
Back to Document Index
Back to Term Index
-
Concordance view (Keyword-In-Context) for the term weighted automata in the ACL ARC 2.0;
- Concordance view in the ACL ARC 1.0 (Sketch Engine Service).
WEIGHTED AUTOMATA can be found in the following ACL ARC 1.0 documents (click to explore):
- (ACL ID: J00-1005) treatment of epsilon moves in subset construction
- (ACL ID: N03-1009) simpler and more general minimization for weighted finite-state automata
- (ACL ID: N06-1045) a better n-best list
- (ACL ID: P03-1006) generalized algorithms for constructing statistical language models
- (ACL ID: P04-1007) discriminative language modeling with conditional random fields and the perceptron algorithm
- (ACL ID: P04-1008) statistical modeling for unit selection in speech synthesis
- (ACL ID: P04-3023) on the equivalence of weighted finite-state transducers
- (ACL ID: P98-2147) dynamic compilation of weighted context-free grammars
- (ACL ID: W01-1404) approximating context-free by rational transduction for example-based mt
- (ACL ID: W04-1504) axiomatization of restricted non-projective dependency trees through finite-state constraints that analyse crossing bracketings
- (ACL ID: W04-2907) general indexation of weighted automata - application to spoken utterance retrieval
- (ACL ID: W98-1306) treatment of e-moves in subset construction
* See also a list of some of the related terms to weighted automata.
Back to Description Index
