Sciweavers

815 search results - page 7 / 163
» Applications of Finite-State Transducers in Natural Language...
Sort
View
FSMNLP
2005
Springer
14 years 1 months ago
TAGH: A Complete Morphology for German Based on Weighted Finite State Automata
TAGH is a system for automatic recognition of German word forms. It is based on a stem lexicon with allomorphs and a concatenative mechanism for inflection and word formation. Wei...
Alexander Geyken, Thomas Hanneforth
ACL
2010
13 years 5 months ago
A Hybrid Rule/Model-Based Finite-State Framework for Normalizing SMS Messages
In recent years, research in natural language processing has increasingly focused on normalizing SMS messages. Different well-defined approaches have been proposed, but the proble...
Richard Beaufort, Sophie Roekhaut, Louise-Am&eacut...
CICLING
2003
Springer
14 years 22 days ago
Positive Grammar Checking: A Finite State Approach
Abstract. This paper reports on the development of a finite state system for finding grammar errors without actually specifying the error. A corpus of Swedish text written by chi...
Sylvana Sofkova Hashemi, Robin Cooper, Robert Ande...
EMNLP
2008
13 years 9 months ago
Latent-Variable Modeling of String Transductions with Finite-State Methods
String-to-string transduction is a central problem in computational linguistics and natural language processing. It occurs in tasks as diverse as name transliteration, spelling co...
Markus Dreyer, Jason Smith, Jason Eisner
ACL
2010
13 years 5 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler