1269 search results - page 41 / 254 » Learning Correction Grammars |
146
click to vote
ECEASST
2008
15 years 6 months ago
2008
: Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages. In the domai...
196
click to vote
GG
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Triple Graph Grammars (TGGs) are a well-established concept for the specification of model transformations. In previous work we have formalized and analyzed already cruc...
166
click to vote
MKM
2009
Springer
16 years 1 months ago
2009
Springer
Many approaches have been proposed over the years for the recognition of mathematical formulae from scanned documents. More recently a need has arisen to recognise formulae from PD...
162
click to vote
ICTAI
2005
IEEE
16 years 5 days ago
2005
IEEE
Learning from noisy data is a challenging and reality issue for real-world data mining applications. Common practices include data cleansing, error detection and classifier ensemb...
146
click to vote
ICMLA
2007
15 years 8 months ago
2007
We study the problem of correcting spelling mistakes in text using memory-based learning techniques and a very large database of token n-gram occurrences in web text as training d...