179 search results - page 18 / 36 » Lambek Grammars Are Context Free |
SIGIR
2012
ACM
11 years 10 months ago
2012
ACM
Cross-language information retrieval (CLIR) today is dominated by techniques that use token-to-token mappings from bilingual dictionaries. Yet, state-of-the-art statistical transl...
ACL
2012
11 years 10 months ago
2012
Most previous studies in computerized deception detection have relied only on shallow lexico-syntactic patterns. This paper investigates syntactic stylometry for deception detecti...
FOSSACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...
LICS
1991
IEEE
13 years 11 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 ...
GG
2010
Springer
13 years 7 months ago
2010
Springer
We introduce an analysis method for graph transformation systems which checks that certain forbidden graphs are not reachable from the start graph. These forbidden graphs are speci...