1788 search results - page 165 / 358 » The Language of Search |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We present two novel approaches to parsing context-free languages. The first approach is based on an extension of Brzozowski’s derivative from regular expressions to c...
ACSC
2005
IEEE
14 years 1 months ago
2005
IEEE
Stemming words to (usually) remove suffixes has applications in text search, machine translation, document summarisation, and text classification. For example, English stemming r...
CP
2005
Springer
14 years 1 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
RSCTC
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
BIS
2008
13 years 9 months ago
2008
Deep web search requires a transformation between search keywords and semantically described and well-formed data structures. We approached this problem in our "In the Web of ...