1000 search results - page 52 / 200 » Dependency Tree Automata |
FSMNLP
2005
Springer
15 years 5 months ago
2005
Springer
We extend finite state registered automata (FSRA) to account for medium-distance dependencies in natural languages. We provide an extended regular expression language whose expres...
75
Voted
ACL
2009
14 years 9 months ago
2009
We present a novel transition system for dependency parsing, which constructs arcs only between adjacent words but can parse arbitrary non-projective trees by swapping the order o...
DFT
2006
IEEE
15 years 3 months ago
2006
IEEE
The concept of clocking for QCA, referred to as the four-phase clocking, is widely used. However, inherited characteristics of QCA, such as the way to hold state, the way to synch...
FM
2006
Springer
15 years 3 months ago
2006
Springer
We propose a new look at one of the most fundamental types of behavioral interfaces: discrete time specifications of communication--directly related to the work of de Alfaro and H...
CAI
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...