Sciweavers

117 search results - page 6 / 24
» An Annotation Scheme for Free Word Order Languages
Sort
View
POPL
1996
ACM
15 years 1 months ago
A Practical and Flexible Flow Analysis for Higher-Order Languages
operators. The analysis is abstract interpretation-based and is parameterized over two polyvariance operators and a projection operator. These operators are used to regulate the sp...
J. Michael Ashley
STACS
2001
Springer
15 years 2 months ago
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
Victor L. Selivanov
73
Voted
PLDI
1995
ACM
15 years 1 months ago
Better Static Memory Management: Improving Region-Based Analysis of Higher-Order Languages
d Abstract) Alexander Aiken Manuel F¨ahndrich Raph Levieny Computer Science Division University of California, Berkeleyz Static memory managementreplaces runtime garbage collecti...
Alexander Aiken, Manuel Fähndrich, Raph Levie...
EMNLP
2008
14 years 11 months ago
Cheap and Fast - But is it Good? Evaluating Non-Expert Annotations for Natural Language Tasks
Human linguistic annotation is crucial for many natural language processing tasks but can be expensive and time-consuming. We explore the use of Amazon's Mechanical Turk syst...
Rion Snow, Brendan O'Connor, Daniel Jurafsky, Andr...
IWPT
2001
14 years 11 months ago
Efficient Sentence Parsing with Language Specific Features: A case Study of Czech
This paper presents two optimalizations of standard parsing techniques applied to Czech as a representative of a free word order language with rich morphology. Our approach is bas...
Ales Horák, Pavel Smrz