Sciweavers

595 search results - page 22 / 119
» Languages Of Analogical Strings
Sort
View
102
Voted
ACL
2007
15 years 1 months ago
Grammar Approximation by Representative Sublanguage: A New Model for Language Learning
We propose a new language learning model that learns a syntactic-semantic grammar from a small number of natural language strings annotated with their semantics, along with basic ...
Smaranda Muresan, Owen Rambow
93
Voted
MT
2007
120views more  MT 2007»
14 years 12 months ago
Capturing practical natural language transformations
We study automata for capturing the transformations in practical natural language processing systems, especially those that translate between human languages. For several variation...
Kevin Knight
LREC
2010
169views Education» more  LREC 2010»
14 years 7 months ago
Language Identification of Short Text Segments with N-gram Models
There are many accurate methods for language identification of long text samples, but identification of very short strings still presents a challenge. This paper studies a languag...
Tommi Vatanen, Jaakko J. Väyrynen, Sami Virpi...
ACL
2012
13 years 2 months ago
MIX Is Not a Tree-Adjoining Language
The language MIX consists of all strings over the three-letter alphabet {a, b, c} that contain an equal number of occurrences of each letter. We prove Joshi’s (1985) conjecture ...
Makoto Kanazawa, Sylvain Salvati
85
Voted
LICS
2008
IEEE
15 years 6 months ago
Piecewise Testable Tree Languages
— This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Σ1 formulas. This is a tree extension of the Simon theorem,...
Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing