Sciweavers

3145 search results - page 259 / 629
» A Computational Psycholinguistic Model of Natural Language P...
Sort
View
ICGI
2004
Springer
15 years 12 months ago
Learnability of Pregroup Grammars
Abstract. This paper investigates the learnability of Pregroup Grammars, a context-free grammar formalism recently defined in the field of computational linguistics. In a first ...
Denis Béchet, Annie Foret, Isabelle Tellier
ACL
2012
13 years 9 months ago
String Re-writing Kernel
Learning for sentence re-writing is a fundamental task in natural language processing and information retrieval. In this paper, we propose a new class of kernel functions, referre...
Fan Bu, Hang Li, Xiaoyan Zhu
ICALP
2004
Springer
15 years 12 months ago
Tree-Walking Automata Cannot Be Determinized
Tree-walking automata are a natural sequential model for recognizing languages of finite trees. Such automata walk around the tree and may decide in the end to accept it. It is s...
Mikolaj Bojanczyk, Thomas Colcombet
ICECCS
1995
IEEE
100views Hardware» more  ICECCS 1995»
15 years 10 months ago
POSD-a notation for presenting complex systems of processes
When trying to describe the behaviour of large systems, such as the business processes of large enterprises, we often adopt diagramming techniques based on derivatives of data flo...
Peter Henderson, Graham D. Pratten
TCSB
2010
15 years 5 months ago
Modelling Self-assembly in BlenX
Abstract. The process through which disordered components spontaneously arrange themselves into patterns is called self-assembly. Molecular self-assembly describes the process by w...
Roberto Larcher, Corrado Priami, Alessandro Romane...