681 search results - page 53 / 137 » Combining Theorem Proving with Natural Language Processing |
101
click to vote
MPC
2010
Springer
15 years 2 months ago
2010
Springer
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
MODELS
2009
Springer
15 years 4 months ago
2009
Springer
The second ACES-MB workshop brought together researchers and practitioners interested in model-based software engineering for realtime embedded systems, with a particular focus on ...
SEMCO
2007
IEEE
15 years 4 months ago
2007
IEEE
Many recent advances in complex domains such as Natural Language Processing (NLP) have taken a discriminative approach in conjunction with the global application of structural and...
COLING
2000
14 years 11 months ago
2000
Complex documents stored in a flat or partially marked up file format require layout sensitive preprocessing before any natural language processing can be carried out on their tex...
CICLING
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Automatic Document summarization is proving to be an increasingly important task to overcome the information overload. The primary task of document summarization process ...