71 search results - page 1 / 15 » A Robust Class of Context-Sensitive Languages |
LICS
2007
IEEE
14 years 2 months ago
2007
IEEE
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
EACL
2006
ACL Anthology
13 years 10 months ago
2006
ACL Anthology
ACL
2007
13 years 10 months ago
2007
Dependency-based representations of natural language syntax require a fine balance between structural flexibility and computational complexity. In previous work, several constra...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la...
NIPS
2003
13 years 10 months ago
2003
We describe a pattern acquisition algorithm that learns, in an unsupervised fashion, a streamlined representation of linguistic structures from a plain natural-language corpus. Th...