762 search results - page 30 / 153 » Intercode Regular Languages |
135
click to vote
COLING
2010
14 years 9 months ago
2010
An unsupervised discriminative training procedure is proposed for estimating a language model (LM) for machine translation (MT). An English-to-English synchronous context-free gra...
121
Voted
ENGL
2007
15 years 2 months ago
2007
In this paper we introduce a finite automaton called partial finite automaton to recognize partial languages. We have defined three classes of partial languages, viz., local pa...
119
Voted
WCRE
2003
IEEE
15 years 7 months ago
2003
IEEE
In reverse engineering, parsing may be partially done to extract lightweight source models. Parsing code containing preprocessing directives, syntactical errors and embedded langu...
141
Voted
ACL
2007
15 years 3 months ago
2007
This paper presents a comparative study of five parameter estimation algorithms on four NLP tasks. Three of the five algorithms are well-known in the computational linguistics com...
108
Voted
CSL
2007
Springer
15 years 8 months ago
2007
Springer
We define regular expressions for unranked trees (actually, ordered sequences of unranked trees, called forests). These are compared to existing regular expressions for trees. On ...