A Paraphrasing System for Transforming Regular Expressions into Honorifics

12 years 11 months ago

Download acl.eldoc.ub.rug.nl

Honorifics in Japanese plays an incredibly important role in all walks of social life. The demand to transform regular expressions in Japanese into honorifics automatically has increased rapidly especially in business situations. This paper reviews existing studies and proposes a system to fill this demand with more practicable functions. The experiment shows the effectiveness of our strategy.

Dongli Han, Shuntaro Kamochi, Xin Song, Naoki Akeg

Real-time Traffic

COLING 2010 | Computational Linguistics | Honorifics | Important Role | Japanese Plays |

claim paper

» Error Mining for Regular Expression Patterns

» Algorithms to accelerate multiple regular expressions matching for deep packet inspection

» Compiling PCRE to FPGA for accelerating SNORT IDS

» Layout Transformations for Heap Objects Using Static Access Patterns

» FirstOrder Logic with Reachability Predicates on Infinite Systems

» Expressing Irregular Computations in Modern Fortran Dialects

» A Generative Shape Regularization Model for Robust Face Alignment

» XML Transformation Language Based on Monadic Second Order Logic

Post Info
More Details (n/a)

Added	13 May 2011
Updated	13 May 2011
Type	Journal
Year	2010
Where	COLING
Authors	Dongli Han, Shuntaro Kamochi, Xin Song, Naoki Akegawa, Tomomasa Hori

Comments (0)

Sciweavers

A Paraphrasing System for Transforming Regular Expressions into Honorifics

COLING 2010 | Computational Linguistics | Honorifics | Important Role | Japanese Plays |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers