1269 search results - page 53 / 254 » Learning Correction Grammars |
90
Voted
DCC
2007
IEEE
16 years 9 days ago
2007
IEEE
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...
TSD
2005
Springer
15 years 6 months ago
2005
Springer
In this paper a new rule-based approach to break assignment for the Russian language is discussed. It is a flexible and robust method of segmentation of texts in Russian in prosod...
ACL
1998
15 years 2 months ago
1998
In relatively free word order languages, grammatical functions are intricately related to case marking. Assuming an ordered representation of the predicate-argument structure, thi...
83
Voted
EACL
1993
ACL Anthology
15 years 2 months ago
1993
ACL Anthology
In this paper a morphological component with a limited capability to automatically interpret (and generate) derived words is presented. The system combines an extended two-level m...
124
click to vote
TCBB
2011
14 years 7 months ago
2011
Stochastic models such as hidden Markov models or stochastic context free grammars can fail to return the correct, maximum likelihood solution in the case of semantic ambiguity. T...