709 search results - page 20 / 142 » In-stroke word completion |
114
click to vote
LICS
1991
IEEE
15 years 3 months ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
COLING
2008
15 years 1 months ago
2008
Data-driven learning based on shift reduce parsing algorithms has emerged dependency parsing and shown excellent performance to many Treebanks. In this paper, we investigate the e...
ACTAC
2008
14 years 12 months ago
2008
In this paper, a characterization of the language varieties and congruence varieties corresponding to M-solid pseudovarieties is presented. Taking into account the isomorphisms of...
100
click to vote
CICLING
2003
Springer
15 years 5 months ago
2003
Springer
This paper presents a graph-theoretical approach to lexical disambiguation on word co-occurrences. Producing a dictionary similar to WordNet, this method is the counterpart to word...
107
click to vote
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...