1423 search results - page 35 / 285 » Languages of Nested Trees |
JIIS
2008
14 years 9 months ago
2008
We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are -close if every word (tree) of one language is -close to the other. A transduc...
120
Voted
CAAP
1994
15 years 1 months ago
1994
Top-context-free tree languages (called cor gulier by Arnold and Dauchet 1, 2]) constitute a natural subclass of context-free tree languages. In this paper, we give further evidenc...
JALC
2007
14 years 9 months ago
2007
Inspired by the results obtained in the string case, we present in this paper the extension of the correction queries to regular tree languages. Relying on Angluin’s and Sakakib...
PODS
2008
ACM
15 years 9 months ago
2008
ACM
A survey of effective characterizations of tree logics. If L is a logic, then an effective characterization for L is an algorithm, which inputs a tree automaton and replies if the...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, an efficient method for language model lookahead probability generation is presented. Traditional methods generate language model look-ahead (LMLA) probabilities fo...