1000 search results - page 47 / 200 » Dependency Tree Automata |
119
click to vote
LICS
1997
IEEE
15 years 3 months ago
1997
IEEE
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...
ACL
2003
15 years 1 months ago
2003
We describe an algorithm for recovering non-local dependencies in syntactic dependency structures. The patternmatching approach proposed by Johnson (2002) for a similar task for p...
101
click to vote
ACL
2009
14 years 9 months ago
2009
We would like to draw attention to Hidden Markov Tree Models (HMTM), which are to our knowledge still unexploited in the field of Computational Linguistics, in spite of highly suc...
123
click to vote
CONCUR
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
ESSLLI
1999
Springer
15 years 4 months ago
1999
Springer
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...