Sciweavers

2 search results - page 1 / 1
» Partial Parsing: Combining Choice with Commitment
Sort
View
IFL
2007
Springer
141views Formal Methods» more  IFL 2007»
13 years 11 months ago
Partial Parsing: Combining Choice with Commitment
Abstract. Parser combinators, often monadic, are a venerable and widelyused solution to read data from some external format. However, the capability to return a partial parse has, ...
Malcolm Wallace
INFFUS
2006
103views more  INFFUS 2006»
13 years 4 months ago
Information fusion approaches to the automatic pronunciation of print by analogy
Automatic pronunciation of words from their spelling alone is a hard computational problem, especially for languages like English and French where there is only a partially consis...
Robert I. Damper, Yannick Marchand