1269 search results - page 41 / 254 » Learning Correction Grammars |
86
Voted
ECEASST
2008
15 years 23 days 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...
120
click to vote
GG
2010
Springer
14 years 11 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...
MKM
2009
Springer
15 years 7 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...
102
Voted
ICTAI
2005
IEEE
15 years 6 months 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...
83
Voted
ICMLA
2007
15 years 2 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...