2316 search results - page 104 / 464 » The many forms of hypercomputation |
107
click to vote
LREC
2010
15 years 6 months ago
2010
Many NLP applications need fundamental tools to convert the input text into appropriate form or format and extract the primary linguistic knowledge of words and sentences. These t...
112
click to vote
LREC
2010
15 years 6 months ago
2010
Electronic dictionaries offer many possibilities unavailable in paper dictionaries to view, display or access information. However, even these resources fall short when it comes t...
121
click to vote
LREC
2008
15 years 6 months ago
2008
Many NLP modules and applications require the availability of a module for wide-coverage inflectional analysis. One way to obtain such analyses is to use an morphological analyser...
143
click to vote
IJCAI
2007
15 years 6 months ago
2007
A formula in first-order logic can be viewed as a tree, with a logical connective at each node, and a knowledge base can be viewed as a tree whose root is a conjunction. Markov l...
139
click to vote
AAAI
2006
15 years 5 months ago
2006
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...