Sciweavers

15 search results - page 2 / 3
» Expressiveness of streaming string transducers
Sort
View
EACL
1989
ACL Anthology
13 years 6 months ago
On The Generative Power Of Two-Level Morphological Rules
Koskenniemi's model of two-level morphology has been very influential in recent years, but definitions of the formalism have generally been phrased in terms of a compilation ...
Graeme D. Ritchie
FOIKS
2008
Springer
13 years 6 months ago
Visibly Pushdown Transducers for Approximate Validation of Streaming XML
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...
Alex Thomo, Srinivasan Venkatesh, Ying Ying Ye
MT
2007
120views more  MT 2007»
13 years 4 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
SODA
2010
ACM
213views Algorithms» more  SODA 2010»
14 years 2 months ago
Regular Expression Matching with Multi-Strings
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
Philip Bille, Mikkel Thorup
POPL
2008
ACM
14 years 5 months ago
Boomerang: resourceful lenses for string data
A lens is a bidirectional program. When read from left to right, it denotes an ordinary function that maps inputs to outputs. When read from right to left, it denotes an "upd...
Aaron Bohannon, J. Nathan Foster, Benjamin C. Pier...