1532 search results - page 162 / 307 » The Symbol Grounding Problem |
126
click to vote
ACL
1997
15 years 6 months ago
1997
String transformation systems have been introduced in (Brill, 1995) and have several applications in natural language processing. In this work we consider the computational proble...
118
click to vote
DAGSTUHL
1990
15 years 5 months ago
1990
A connectionist model for robust reasoning, CONSYDERR, is proposed to account for some common reasoning patterns found in commonsense reasoning and to remedy the brittleness probl...
127
click to vote
ATVA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. This work introduces a new data structure, called Lattice-Valued Binary Decision Diagrams (or LVBDD for short), for the compact representation and manipulation of functio...
136
Voted
JALC
2006
15 years 4 months ago
2006
Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computing model, n...
160
click to vote
IANDC
2007
15 years 4 months ago
2007
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...