234 search results - page 42 / 47 » On Quasi-Products of Tree Automata |
127
click to vote
EMNLP
2010
14 years 11 months ago
2010
This paper introduces algorithms for nonprojective parsing based on dual decomposition. We focus on parsing algorithms for nonprojective head automata, a generalization of head-au...
80
Voted
CORR
2010
Springer
15 years 27 days ago
2010
Springer
An -tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism probl...
MT
2007
15 years 25 days ago
2007
We study automata for capturing the transformations in practical natural language processing systems, especially those that translate between human languages. For several variation...
114
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
107
click to vote
LATA
2009
Springer
15 years 8 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...