1000 search results - page 72 / 200 » Dependency Tree Automata |
117
click to vote
CMSB
2007
Springer
15 years 6 months ago
2007
Springer
For modeling and analyzing regulatory networks based on qualitative information and possibly additional temporal constraints, approaches using hybrid automata can be very helpful. ...
FCT
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. An iterative array is a line of interconnected interacting finite automata. One distinguished automaton, the communication cell, is connected to the outside world and fe...
NIPS
2003
15 years 1 months ago
2003
We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...
129
click to vote
EMNLP
2009
14 years 9 months ago
2009
This paper presents an effective method for generating natural language sentences from their underlying meaning representations. The method is built on top of a hybrid tree repres...
JDCTA
2010
14 years 6 months ago
2010
We implement a Korean syntactic analyzer which decreases many ambiguities in syntax parse trees using segmentation and semantic connection units. We use dependency grammar for par...